HAM
- 30 August 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 11 (4), 195-212
- https://doi.org/10.1145/1035332.1035322
Abstract
An approximate analytical method for estimating performance statistics of general closed queueing network models of computing systems is presented. These networks may include queues with priority scheduling disciplines and non-exponential servers and several classes of jobs. The method is based on the aggregation theorem (Norton's theorem) of Chandy, Herzog and Woo.Keywords
This publication has 14 references indexed in Scilit:
- The method of surrogate delaysACM SIGMETRICS Performance Evaluation Review, 1981
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Approximate Methods for Analyzing Queueing Network Models of Computing SystemsACM Computing Surveys, 1978
- Product Form and Local Balance in Queueing NetworksJournal of the ACM, 1977
- Hierarchical techniques for the development of realistic models of complex computer systemsProceedings of the IEEE, 1975
- Solution of Queuing Problems by a Recursive TechniqueIBM Journal of Research and Development, 1975
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Approximate Analysis of General Queuing NetworksIBM Journal of Research and Development, 1975
- Device Design Considerations for Ion Implanted n-Channel MOSFETsIBM Journal of Research and Development, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973