Published December 1982
| public
Journal Article
HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems
- Creators
- Neuse, Doug
- Chandy, K. Mani
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.
Additional Information
© 1982 ACM. This work was supported in part by NSF Grant MCS81-01911.Additional details
- Eprint ID
- 92256
- DOI
- 10.1145/1035293.1035322
- Resolver ID
- CaltechAUTHORS:20190114-142130380
- MCS81-01911
- NSF
- Created
-
2019-01-22Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field