article

Free access

Analysis of balanced fork-join queueing networks

Authors:

Elizabeth Varki,

Lawrence W. DowdyAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 24, Issue 1

Pages 232 - 241

https://doi.org/10.1145/233008.233048

Published: 15 May 1996 Publication History

PDF eReader

Abstract

This paper presents an analysis of closed, balanced, fork-join queueing networks with exponential service time distributions. The fork-join queue is mapped onto two non-parallel networks, namely, a serial-join model and a state-dependent model. Using these models, it is proven that the proportion of the number of jobs in the different subsystems of the fork-join queueing network remains constant, irrespective of the multiprogramming level. This property of balanced fork-join networks is used to compute quick, inexpensive bounds for arbitrary fork-join networks.

References

[1]

Baccelli, F. "Two parallel queues created by arrivals with two demands: The M/G/2 symmetrical case", l~eport INRIA, 426, July 1985.

Google Scholar

[2]

Cooper, R. B. Introduction to Queueing Theory, Mercury Press/Fairchild Publications- a Capital Cities/ABC, Inc. company, MD, 3rd edition, 1990.

Google Scholar

[3]

Flatto, L., Hahn, S. "Two parallel queues created by arrivals with two demands I", SIAM J. Appl. Math., 44, Oct. 1984, pp. 1041- 1053.

Crossref

Google Scholar

[4]

Lavenberg, S.S., Reiser, M. "Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers", Journal of Appl. Prob., 17, Dec 1980, pp. 1048- 1061.

Crossref

Google Scholar

[5]

Reiser, M., Lavenberg, S.S. "Mean-value analysis of closed multichain queueing networks", Journal of the ACM, 27, 2, April 1980, pp. 313- 322.

Digital Library

Google Scholar

[6]

Sevcik, K. C., Mitrani, I. "The distribution of queueing network states at input and output instants", JACM, 28, 2, April 1981, pp. 358 - 371.

Digital Library

Google Scholar

[7]

Suri, R. "Robustness of queueing network formulas", JACM, 30, 3, July 1983, pp. 564- 594.

Digital Library

Google Scholar

[8]

Varki, E., Dowdy, L.W. "Response time analysis of two server fork-join systems", MASCOTS, 1996.

Digital Library

Google Scholar

[9]

Zahorjan, J., Sevcik, K.C., Eager, D.L., Galler, B. "Balanced job bound analysis of queueing networks", Comm. of ACM, 25, 2, 1982, pp. 134-141.

Digital Library

Google Scholar

Cited By

View all

Ardagna DBarbierato EGianniti EGribaudo MPinto Tda Silva AAlmeida J(2020)Predicting the performance of big data applications on the cloudThe Journal of Supercomputing10.1007/s11227-020-03307-wOnline publication date: 15-May-2020
https://doi.org/10.1007/s11227-020-03307-w
Ardagna DBarbierato EEvangelinou AGianniti EGribaudo MPinto TGuimarães ACouto da Silva AAlmeida JWolter KKnottenbelt Wvan Hoorn ANambiar MKoziolek H(2018)Performance Prediction of Cloud-Based Big Data ApplicationsProceedings of the 2018 ACM/SPEC International Conference on Performance Engineering10.1145/3184407.3184420(192-199)Online publication date: 30-Mar-2018
https://dl.acm.org/doi/10.1145/3184407.3184420
Lu HPang G(2016)Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy TrafficMathematics of Operations Research10.1287/moor.2015.074041:2(560-595)Online publication date: May-2016
https://doi.org/10.1287/moor.2015.0740
Show More Cited By

Index Terms

Analysis of balanced fork-join queueing networks

Recommendations

Analysis of balanced fork-join queueing networks
SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

This paper presents an analysis of closed, balanced, fork-join queueing networks with exponential service time distributions. The fork-join queue is mapped onto two non-parallel networks, namely, a serial-join model and a state-dependent model. Using ...
Bounds for Two Server Fork-Join Queueing Systems
Analysis of the Fork-Join Queue

A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 24, Issue 1

May 1996

273 pages

ISSN:0163-5999

DOI:10.1145/233008

Editors:
Blaine E. Gaither
Hewlett-Packard, Fort Collins, CO
,
Daniel A. Reed
Univ. of Illinois, Urbana

Issue’s Table of Contents

SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
May 1996
279 pages
ISBN:0897917936
DOI:10.1145/233013
Chairman:
Daniel A. Reed
Univ. of Illinois, Urbana
,
Editor:
Blaine D. Gaither
Hewlett-Packard, Fort Collins, CO

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: 15 May 1996

Published in SIGMETRICS Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
448
Total Downloads

Downloads (Last 12 months)57
Downloads (Last 6 weeks)12

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ardagna DBarbierato EGianniti EGribaudo MPinto Tda Silva AAlmeida J(2020)Predicting the performance of big data applications on the cloudThe Journal of Supercomputing10.1007/s11227-020-03307-wOnline publication date: 15-May-2020
https://doi.org/10.1007/s11227-020-03307-w
Ardagna DBarbierato EEvangelinou AGianniti EGribaudo MPinto TGuimarães ACouto da Silva AAlmeida JWolter KKnottenbelt Wvan Hoorn ANambiar MKoziolek H(2018)Performance Prediction of Cloud-Based Big Data ApplicationsProceedings of the 2018 ACM/SPEC International Conference on Performance Engineering10.1145/3184407.3184420(192-199)Online publication date: 30-Mar-2018
https://dl.acm.org/doi/10.1145/3184407.3184420
Lu HPang G(2016)Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy TrafficMathematics of Operations Research10.1287/moor.2015.074041:2(560-595)Online publication date: May-2016
https://doi.org/10.1287/moor.2015.0740
Villela D(2009)Minimizing the Average Completion Time for Concurrent Grid ApplicationsJournal of Grid Computing10.1007/s10723-009-9119-28:1(47-59)Online publication date: 22-May-2009
https://doi.org/10.1007/s10723-009-9119-2
Varki E(2001)Response Time Analysis of Parallel Computer and Storage SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.96912512:11(1146-1161)Online publication date: 1-Nov-2001
https://dl.acm.org/doi/10.1109/71.969125
Karatza H(1998)Task routing and resequencing in a multiprocessor systemJournal of Systems and Software10.1016/S0164-1212(97)10019-X41:3(189-197)Online publication date: 1-Jun-1998
https://dl.acm.org/doi/10.1016/S0164-1212%2897%2910019-X
Cortellessa VDi Marco AInverardi PCortellessa VDi Marco AInverardi P(2011)From Software Models to Performance ModelsModel-Based Software Performance Analysis10.1007/978-3-642-13621-4_5(79-140)Online publication date: 2011
https://doi.org/10.1007/978-3-642-13621-4_5
Casale GMuntz RSerazzi G(2008)Geometric BoundsIEEE Transactions on Computers10.1109/TC.2008.3757:6(780-794)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1109/TC.2008.37
Jiang LGiachetti R(2007)A queueing network model to analyze the impact of parallelization of care on patient cycle timeHealth Care Management Science10.1007/s10729-007-9040-911:3(248-261)Online publication date: 19-Dec-2007
https://doi.org/10.1007/s10729-007-9040-9
Varki E(1999)Mean value technique for closed fork-join networksACM SIGMETRICS Performance Evaluation Review10.1145/301464.30148427:1(103-112)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301464.301484
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations