D. L. Eager
Abstract
In applications of queueing network models to computer system performance prediction, the computational effort required to obtain an exact equilibrium solution of a model may not be justified by the accuracy actually required. In these cases, there is a need for approximation or bounding techniques that can provide the necessary information at reduced cost. This paper presents Performance Bound Hierarchies (PBHs) for single class separable queueing networks consisting of fixed rate and delay service centers. A PBH consists of a hierarchy of upper (pessimistic) or lower (optimistic) bounds on mean system residence time. (The bounds can also be expressed as bounds on system throughput or center utilizations.) Each successive member requires more computational effort, and in the limit, the bounds converge to the exact solution.
- {Denning & Buzen 78} Denning, P. J., and J. P. Buzen. The operational analysis of queueing network models. ACM Computing Surveys 10, 3 (Sept. 1978), 225--261. Google Scholar
Digital Library
- {Kleinrock 76} Kleinrock, L. Queueing Systems: Volume 2. John Wiley & Sons, 1976.Google Scholar
- {Muntz & Wong 74} Muntz, R. R., and J. Wong. Asymptotic properties of closed queueing network models. 8th Annual Princeton Conf. on Inf. Sci. and Systems, Princeton University, March 1974.Google Scholar
- {Reiser & Lavenberg 80} Reiser, M., and S. S. Lavenberg. Mean value analysis of closed multichain queueing networks. J. ACM 27, 2 (April 1980), 313--322. Google ScholarDigital Library
- {Zahorjan, et al. 82} Zahorjan, J., K. C. Sevcik, D. L. Eager, and B. I. Galler, Balanced job bound analysis of queueing networks. Comm. ACM 25, 2 (Feb. 1982), 134--141. Google ScholarDigital Library
Recommendations
Performance bound hierarchies for queueing networks
SIGMETRICS '82: Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systemsIn applications of queueing network models to computer system performance prediction, the computational effort required to obtain an exact equilibrium solution of a model may not be justified by the accuracy actually required. In these cases, there is a ...
Bound analysis of closed queueing networks with workload burstiness
SIGMETRICS '08Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models as these features are responsible of significant performance ...
Bound analysis of closed queueing networks with workload burstiness
SIGMETRICS '08: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systemsBurstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models as these features are responsible of significant performance ...
Comments