More Web Proxy on the site http://driver.im/

article

Free access

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

Authors:

K. Mani ChandyAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 11, Issue 4

Pages 195 - 212

https://doi.org/10.1145/1035332.1035322

Published: 30 August 1982 Publication History

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.

References

[1]

BALB79 G. Balbo, "Approximate Solutions of Queueing Network Models of Computer Systems," Ph.D. Thesis, Purdue University, December 1979.

Digital Library

[2]

BARD79 Y. Bard, "Some Extensions to Multiclass Queueing Network Analysis," G320-2124, IBM Cambridge Scientific Center, Cambridge, Mass. (Nov. 1978). In M. Arato, A. Butrimenko, and E. Gelenbe, editors, Performance of Computer Systems, North Holland, Amsterdam, pp. 51--61 (1979).

Digital Library

[3]

BASK75 F. Baskett, K. M. Chandy, R. R. Muntz, and F. Palacios-Gomez, "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers," JACM 22, 2 (April 1975).

Digital Library

[4]

BROW75 J. C. Browne, K. M. Chandy, R. M. Brown, T. W. Keller, D. F. Towsley and C. W. Dissley, "Hierarchical Techniques for Development of Realistic Models of Complex Computer Systems," Proc. IEEE 63, 6 (June 1975), 966--975.

[5]

BUZE71 J. P. Buzen, "Queueing Network Models of Multiprogramming," Ph. D. Thesis, Harvard University, Cambridge, Mass. (1971).

[6]

BUZE73 J. P. Buzen, "Computational Algorithms for Closed Queueing Networks with Exponential Servers." Communications of the Association for Computing Machinery 16, (9): 527--531.

Digital Library

[7]

CHAN72 K. M. Chandy, "The Analysis and Solutions for General Queueing Networks," Proc. 6th Annual Princeton Conf. on Information Science and Systems, (1972) pp. 224--228.

[8]

CHAN75a K. M. Chandy, U. Herzog and L. S. Woo, "Parametric Analysis of Queueing Networks," IBM J. of Research and Development 19, 1 pp. 43--49 (January 1975).

Digital Library

[9]

CHAN75b K. M. Chandy, U. Herzog and L. S. Woo, "Approximate Analysis of General Queueing Networks," IBM J. of Research and Development 19, 1 pp. 50--57 (January 1975).

Digital Library

[10]

CHAN77 K. M. Chandy, J. H. Howard and D. F. Towsley, "Product Form and Local Balance in Queueing Networks," JACM 24, 2 pp. 250--263 (April 1977).

Digital Library

[11]

CHAN78 K. M. Chandy and C. H. Sauer, "Approximate Methods for Analysis of Queueing Network Models of Computer Systems," Computing Surveys 10, 3 pp. 263--280 (September 1978).

Digital Library

[12]

CHAN79 K. M. Chandy and C. H. Sauer, "Computational Algorithms for Product Form Queueing Networks," RC-7950, IBM Research, Yorktown Heights, N. Y. (November 1979). CACM 23, 10 (October 1980).

Digital Library

[13]

HERZ75 U. Herzog, L. S. Woo and K. M. Chandy, "Solution of Queueing Problems by a Recursive Technique," IBM J. of Research and Development 19, 3 (May 1975) pp. 295--300.

Digital Library

[14]

IRA80 Information Research Associates, PAWS 1.2 Performance Analyst's Workbench System Modelling Methodology and User's Manual, Information Research Associates, Austin, Texas (1981).

[15]

JACO81 P. Jacobson and E. D. Lazowska, "The Method of Surrogate Delays: Simultaneous Resource Possession in Analytic Models of Computer Systems," Performance Evaluation Review 10, 3 (Fall 1981).

Digital Library

[16]

MARI79 R. A. Marie, "An Approximate Analytical Method for General Queueing Networks," IEEE Transactions on Software Engineering SE-5, 5 (September 1979).

[17]

MCDO70 M. H. MacDougal, "Computer System Simulation: An Introduction." Computing Surveys 2, 3, pp. 191--209 (1970).

Digital Library

[18]

REIS78 M. Reiser and C. H. Sauer, "Queueing Network Models: Methods of Solution and their Program Implementation," in K. M. Chandy and R. T. Yeh, editors, Current Trends in Programming Methodology, Volume III: Software Modeling and Its Impact on Performance. Prentice-Hall (1978) pp. 115--167.

[19]

SAUE75a C. H. Sauer, "Configuration of Computing Systems: An Approach Using Queueing Network Models," Ph. D. Thesis, Univ. of Texas at Austin (May 1975).

Digital Library

[20]

SAUE75b C. H. Sauer and K. M. Chandy, "Approximate Analysis of Central Server Models," IBM J. of Research and Development 19, 3 (May 1975) pp. 301--313.

Digital Library

[21]

SAUE78 C. H. Sauer and E. A. MacNair, "Queueing Network Software for Systems Modeling," RC-7143, IBM Research, Yorktown Heights, N. Y. (May 1978). Software-Practice and Experience 9, 5 (May 1979).

[22]

SAUE81a C. H. Sauer, "Approximate Solution of Queueing Networks with Simultaneous Resource Possession," IBM J. of Research and Development 25, 6 (November 1981) pp. 894--903.

Digital Library

[23]

SAUE81b C. H. Sauer and K. M. Chandy, Computer Systems Performance Modeling, Prentice-Hall, Englewood Cliffs, N. J. (1981).

[24]

SCHW78 H. D. Schwetman, "Hybrid Simulation Models of Computer Systems," CACM 21, 9 (Sept. 1978) pp. 718--723.

Digital Library

[25]

SEVC77a K. C. Sevcik, "Priority Scheduling Disciplines in Queueing Network Models of Computer Systems," Proc. IFIP Congress 77, pp. 565--570.

[26]

SEVC77b K. C. Sevcik, A. Levy, S. K. Tripathi and J. L. Zahorjan, "Improved Approximations of Aggregated Queueing Network Subsystems," Computer Performance, K. M. Chandy and M. Reiser (Eds.), Elsevier North-Holland, Inc., New York, 1977, pp. 1--22.

[27]

SHUM77 A. Shum and J. P. Buzen, "The EPF Technique: A Method for Obtaining Approximate Solutions to Closed Queueing Networks with General Service Times," Measuring Modeling and Evaluating Computer Systems, H. Beilner and E. Gelenbe (Eds.), North-Holland, Amsterdam (1977) pp. 201--220.

Digital Library

[28]

TRIP79 S. K. Tripathi, "On Approximate Solution Techniques for Queueing Network Models of Computer Systems," Ph.D. Thesis, Univ. of Toronto, (1979).

Digital Library

Cited By

van der Gaast Jde Koster MAdan I(2018)Conveyor Merges in Zone Picking SystemsTransportation Science10.1287/trsc.2017.078252:6(1428-1443)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1287/trsc.2017.0782
Inman R(2016)Scheduling Preventive Overtime: A New Approach for the Automotive IndustryIIE Transactions10.1080/15458830.1996.1177070028:7(555-565)Online publication date: 13-Sep-2016
https://doi.org/10.1080/15458830.1996.11770700
Lagershausen SLagershausen S(2012)Literature ReviewPerformance Analysis of Closed Queueing Networks10.1007/978-3-642-32214-3_3(15-44)Online publication date: 31-Aug-2012
https://doi.org/10.1007/978-3-642-32214-3_3
Show More Cited By

Index Terms

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

Recommendations

HAM: the heuristic aggregation method for solving general closed queueing network models of computer systems
SIGMETRICS '82: Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling 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 ...
Analysis of a dynamic assignment of impatient customers to parallel queues

Consider a number of parallel queues, each with an arbitrary capacity and multiple identical exponential servers. The service discipline in each queue is first-come-first-served (FCFS). Customers arrive according to a state-dependent Poisson process. ...
Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula

In this paper, we consider the steady-state queue length distribution of the GI/G/1/K queue. As a result, we obtain transform-free expressions for the steady-state queue length distributions at an arrival, at a departure and at an arbitrary time, all in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 11, Issue 4

December 1982

258 pages

ISSN:0163-5999

DOI:10.1145/1035332

Issue’s Table of Contents

SIGMETRICS '82: Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
August 1982
264 pages
ISBN:0897910796
DOI:10.1145/1035293
Program Chair:
Edward D. Lazowska
Univ. of Washington

Copyright © 1982 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 August 1982

Published in SIGMETRICS Volume 11, Issue 4

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
362
Total Downloads

Downloads (Last 12 months)116
Downloads (Last 6 weeks)24

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

van der Gaast Jde Koster MAdan I(2018)Conveyor Merges in Zone Picking SystemsTransportation Science10.1287/trsc.2017.078252:6(1428-1443)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1287/trsc.2017.0782
Inman R(2016)Scheduling Preventive Overtime: A New Approach for the Automotive IndustryIIE Transactions10.1080/15458830.1996.1177070028:7(555-565)Online publication date: 13-Sep-2016
https://doi.org/10.1080/15458830.1996.11770700
Lagershausen SLagershausen S(2012)Literature ReviewPerformance Analysis of Closed Queueing Networks10.1007/978-3-642-32214-3_3(15-44)Online publication date: 31-Aug-2012
https://doi.org/10.1007/978-3-642-32214-3_3
Park CLee H(2011)A multi-class closed queueing maintenance network model with a parts inventory systemComputers and Operations Research10.1016/j.cor.2011.01.02038:11(1584-1595)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1016/j.cor.2011.01.020
Jia JHeragu S(2009)Solving Semi-Open Queuing NetworksOperations Research10.1287/opre.1080.062757:2(391-401)Online publication date: 1-Mar-2009
https://dl.acm.org/doi/10.1287/opre.1080.0627
Venkatesh TSiva Ram Murthy CVenkatesh TMurthy C(2009)Traffic Characteristics in OBS NetworksAn Analytical Approach to Optical Burst Switched Networks10.1007/978-1-4419-1510-8_2(43-99)Online publication date: 30-Oct-2009
https://doi.org/10.1007/978-1-4419-1510-8_2
Xu LPerros H(2007)Performance analysis of an ingress switch in a JumpStart optical burst switching networkPerformance Evaluation10.1016/j.peva.2006.05.01264:4(315-346)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1016/j.peva.2006.05.012
Baynat BDallery Y(1996)A product-form approximation method for general closed queueing networks with several classes of customersPerformance Evaluation10.1016/0166-5316(94)00028-X24:3(165-188)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1016/0166-5316%2894%2900028-X
Spaniol OKremer WFasbender A(1992)TPNA: Ein neues Analyseverfahren für Tandem-Prioritäten-NetzeInformatik10.1007/978-3-322-95233-2_25(401-423)Online publication date: 1992
https://doi.org/10.1007/978-3-322-95233-2_25
Tomaras PKouvatos D(1991)MRE hierarchical decomposition of general queueing network modelsActa Informatica10.1007/BF0117850728:3(265-295)Online publication date: 1-Jan-1991
https://dl.acm.org/doi/10.1007/BF01178507
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Issue’s Table of Contents