article

Free access

Linearizer: a heuristic algorithm for queueing network models of computing systems

Authors:

K. Mani Chandy,

Doug NeuseAuthors Info & Claims

Communications of the ACM, Volume 25, Issue 2

Pages 126 - 134

https://doi.org/10.1145/358396.358403

Published: 01 February 1982 Publication History

PDF eReader

References

[1]

Bard, Y. A model of shared DASD and multipathing. Comm. ACM 23,10 (Oct. 1980), 564-572.

Digital Library

Google Scholar

[2]

Bard, Y. Some extensions to multiclass queueing network analysis. In Performance of Computer Systems. Arato, M., Butrimenko, A., and Gelenbe, E. (Eds.), North Holland, Amsterdam, 1979.

Digital Library

Google Scholar

[3]

Bard, Y. The VM/370 performance predictor. Comput. Surv. 10,8 (Sept. 1978), 333-342.

Digital Library

Google Scholar

[4]

Brown, R.M., Browne, J.C., and Chandy, K.M. Memory management and response time. Comm. ACM 20,3 (March 1977), 153-165.

Digital Library

Google Scholar

[5]

Buzen, J.P., and Denning, P.J. Measuring and calculating queue length distributions. Computer 13,4 (April 1980), 33--46.

Digital Library

Google Scholar

[6]

Chandy, K.M., Herzog, U., and Woo, L. Approximate analysis of general queueing networks. IBM J. Res. Develop. 19,1 (Jan. 1975), 43-49.

Google Scholar

[7]

Comput. Surv. 10,3 (Sept. 78), Special Issue on Queueing Network Models of Computer System Performance.

Google Scholar

[8]

Lavenberg, S.S., and Reiser, M. Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers. Res. Rep. RC 7592, IBM Corp., April 1979. IBM Thomas J. Watson Research Center, Yorktown Heights, NY.

Google Scholar

[9]

Little, J.D.C. A proof of the queueing formula L = W. Oper. Res. 9 (1961), 383-387.

Digital Library

Google Scholar

[10]

Reiser, M., and Lavenberg, S.S. Mean-value analysis of closed multichain queueing networks.L ACM 27,2 (April 1980), 313-322.

Digital Library

Google Scholar

[11]

Sauer, C.H., and Chandy, K.M. Computer System Performance Modeling: A Primer. Prentice-Hall, Englewood Cliffs, N J, 1980.

Google Scholar

[12]

Schweitzer, P. Approximate analysis of multiclass closed networks of queues. Presented at the Int. Conf. Stochastic Control and Optimization, Amsterdam, 1979.

Google Scholar

[13]

Sevcik, K.C., and Mitrani, I. The distribution of queueing network states at input and output instants. J. A CM 28,2 (April 1981), 358-371.

Digital Library

Google Scholar

[14]

Zahorjan, J. The approximate solution of large queueing network models. Ph.D. Thesis, Univ. Toronto, Toronto, Ont., Canada, 1980; also Tech. Rep. CSRG-122, Univ. Toronto, Toronto, Ont., Canada August 1980.

Digital Library

Google Scholar

Cited By

View all

Casale GGao YNiu ZZhu L(2024)LN: A Flexible Algorithmic Framework for Layered Queueing Network AnalysisACM Transactions on Modeling and Computer Simulation10.1145/363345734:3(1-26)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3633457
Dobre RNiu ZCasale GBalsamo SKnottenbelt WAbad CShang W(2024)Approximating Fork-Join Systems via Mixed Model TransformationsCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3652277(273-280)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3652277
Niu ZCasale G(2024)Neural Density Estimation of Response Times in Layered Software SystemsIEEE Transactions on Software Engineering10.1109/TSE.2024.336009350:3(636-650)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TSE.2024.3360093
Show More Cited By

Index Terms

Linearizer: a heuristic algorithm for queueing network models of computing systems

Recommendations

Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach

The paper provides the up- and down-crossing method to study the asymptotic behavior of queue-length and waiting time in closed Jackson-type queueing networks. These queueing networks consist of central node (hub) and k single-server satellite stations. ...
A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station

The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client station) is a single server queueing system with autonomous service, i.e. every ...
Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers

Suppose there are a fixed number of waiting positions which need to be allocated between two nodes in a closed, two-node, cyclic, queueing network with multiple servers in order to maximize throughput. We determine the optimal allocation under quite ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 25, Issue 2

Feb 1982

61 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358396

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

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: 01 February 1982

Published in CACM Volume 25, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

232
Total Citations
View Citations
834
Total Downloads

Downloads (Last 12 months)110
Downloads (Last 6 weeks)10

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Casale GGao YNiu ZZhu L(2024)LN: A Flexible Algorithmic Framework for Layered Queueing Network AnalysisACM Transactions on Modeling and Computer Simulation10.1145/363345734:3(1-26)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3633457
Dobre RNiu ZCasale GBalsamo SKnottenbelt WAbad CShang W(2024)Approximating Fork-Join Systems via Mixed Model TransformationsCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3652277(273-280)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3652277
Niu ZCasale G(2024)Neural Density Estimation of Response Times in Layered Software SystemsIEEE Transactions on Software Engineering10.1109/TSE.2024.336009350:3(636-650)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1109/TSE.2024.3360093
Luan SShen H(2024)Minimize Resource Cost for Containerized Microservices Under SLO via ML-Enhanced Layered Queueing Network Optimization2024 14th International Conference on Cloud Computing, Data Science & Engineering (Confluence)10.1109/Confluence60223.2024.10463310(631-637)Online publication date: 18-Jan-2024
https://doi.org/10.1109/Confluence60223.2024.10463310
Zhou SWoodside MFeng DBecker SHerbst NLeitner P(2022)A Multiserver Approximation for Cloud Scaling AnalysisCompanion of the 2022 ACM/SPEC International Conference on Performance Engineering10.1145/3491204.3527472(129-136)Online publication date: 14-Jul-2022
https://dl.acm.org/doi/10.1145/3491204.3527472
Zhou SWoodside M(2022)A Robust Approximation for Multiclass Multiserver Queues with Applications to Microservices SystemsComputer Performance Engineering10.1007/978-3-031-25049-1_4(54-68)Online publication date: 21-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-25049-1_4
Niu ZCasale G(2021)A Mixture Density Network Approach to Predicting Response Times in Layered Systems2021 29th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)10.1109/MASCOTS53633.2021.9614286(1-8)Online publication date: 3-Nov-2021
https://doi.org/10.1109/MASCOTS53633.2021.9614286
Casale GHarrison POng W(2021)Facilitating load-dependent queueing analysis through factorizationPerformance Evaluation10.1016/j.peva.2021.102241152:COnline publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1016/j.peva.2021.102241
Zhu LCasale GPerez I(2020)Fluid approximation of closed queueing networks with discriminatory processor sharingPerformance Evaluation10.1016/j.peva.2020.102094(102094)Online publication date: Feb-2020
https://doi.org/10.1016/j.peva.2020.102094
Legato PMazza R(2019)Class Aggregation for Multi-class Queueing Networks with FCFS Multi-server StationsQueueing Theory and Network Applications10.1007/978-3-030-27181-7_14(221-239)Online publication date: 27-Aug-2019
https://dl.acm.org/doi/10.1007/978-3-030-27181-7_14
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach

A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station

Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations