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

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.

[1]  M. H. MacDougall.  Computer System Simulation: An Introduction , 1970, CSUR.

[2]  Jeffrey P. Buzen,et al.  Queueing Network Models of Multiprogramming , 1971, Outstanding Dissertations in the Computer Sciences.

[3]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[4]  V. L. Rideout,et al.  Device design considerations for ion implanted n-channel MOSFETs , 1975 .

[5]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..

[6]  J.C. Browne,et al.  Hierarchical techniques for the development of realistic models of complex computer systems , 1975, Proceedings of the IEEE.

[7]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[8]  C. H. Sauer,et al.  Configuration of computing systems: an approach using queueing network models. , 1975 .

[9]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[10]  K. Mani Chandy,et al.  Solution of Queuing Problems by a Recursive Technique , 1975, IBM J. Res. Dev..

[11]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[12]  Kenneth C. Sevcik,et al.  Priority Scheduling Disciplines in Queuing Network Models of Computer Systems , 1977, IFIP Congress.

[13]  Jeffrey P. Buzen,et al.  A Method for Obtaining Approximate Solutions to Closed Queueing Networks with General Service Times , 1977, Performance.

[14]  Herb Schwetman.  Hybrid simulation models of computer systems , 1978, CACM.

[15]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[16]  Satish Kumar Tripathi,et al.  On approximate solution techniques for queueing network models of computer systems , 1979 .

[17]  Charles H. Sauer,et al.  Queueing network software for systems modelling , 1979, Softw. Pract. Exp..

[18]  Yonathan Bard,et al.  Some Extensions to Multiclass Queueing Network Analysis , 1979, Performance.

[19]  Raymond A. Marie.  An Approximate Analytical Method for General Queueing Networks , 1979, IEEE Transactions on Software Engineering.

[20]  Gianfranco Balbo,et al.  Approximate solutions of queueing network models of computer systems , 1979 .

[21]  K. Mani Chandy,et al.  Computational algorithms for product form queueing networks , 1980, Performance.

[22]  Charles H. Sauer,et al.  Approximate Solution of Queueing Networks with Simultaneous Resource Possession , 1981, IBM J. Res. Dev..

[23]  Edward D. Lazowska,et al.  The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems , 1981, SIGMETRICS '81.

[24]  K. Mani Chandy,et al.  Computer Systems Performance Modeling , 1981 .