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

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.