Analysis of balanced fork-join queueing networks

Authors:
Elizabeth Varki;Lawrence W. Dowdy
Affiliations:
Department of Computer Science, Vanderbilt University, Nashville, TN;Department of Computer Science, Vanderbilt University, Nashville, TN
Venue:
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
1996

Citing 5
Cited 3

Robustness of queuing network formulas

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
The Distribution of Queuing Network States at Input and Output Instants

Journal of the ACM (JACM)
Balanced job bound analysis of queueing networks

Communications of the ACM
Response-Time Analysis of Two Server Fork-Join Systems

MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems

Mean value technique for closed fork-join networks

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Response Time Analysis of Parallel Computer and Storage Systems

IEEE Transactions on Parallel and Distributed Systems
Queueing network models of credit-based flow control

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

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.