CaltechAUTHORS
  A Caltech Library Service

HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems

Neuse, Doug and Chandy, K. Mani (1982) HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems. ACM SIGMETRICS Performance Evaluation Review, 11 (4). pp. 195-212. ISSN 0163-5999. http://resolver.caltech.edu/CaltechAUTHORS:20190114-142130380

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190114-142130380

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1145/1035293.1035322DOIArticle
Additional Information:© 1982 ACM. This work was supported in part by NSF Grant MCS81-01911.
Funders:
Funding AgencyGrant Number
NSFMCS81-01911
Subject Keywords:Approximations, analytical models, performance analysis, general closed queueing networks, computer system models, priority scheduling, non-local-balance, non-product-form, aggregation theorem
Classification Code:CR categories: C.4, D.4.8, I.6.
Record Number:CaltechAUTHORS:20190114-142130380
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190114-142130380
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92256
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Jan 2019 22:56
Last Modified:22 Jan 2019 22:56

Repository Staff Only: item control page