OR Spectrum

, Volume 34, Issue 3, pp 723–742 | Cite as

Mean sojourn times in two-queue fork-join systems: bounds and approximations

Open Access
Regular Article

Abstract

This paper considers a fork-join system (or: parallel queue), which is a two-queue network in which any arrival generates jobs at both queues and the jobs synchronize before they leave the system. The focus is on methods to quantify the mean value of the ‘system’s sojourn time’ S: with Si denoting a job’s sojourn time in queue i, S is defined as max{S1, S2}. Earlier work has revealed that this class of models is notoriously hard to analyze. In this paper, we focus on the homogeneous case, in which the jobs generated at both queues stem from the same distribution. We first evaluate various bounds developed in the literature, and observe that under fairly broad circumstances these can be rather inaccurate. We then present a number of approximations, that are extensively tested by simulation and turn out to perform remarkably well.

Keywords

Queueing Fork-join network Simulation Parallel processing Synchronization Throughput time 

Notes

Acknowledgments

The authors would like to thank the editor and the referees for their useful and valuable comments.

Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

References

  1. Asmussen S, Nerman O, Olssen M (1996) Fitting phase-type distributions via the EM algorithm. Scand J Stat 23(4): 419–441Google Scholar
  2. Baccelli F, Makowski AM (1985) Simple computable bounds for the fork-join queue. In: Proceedings of Johns Hopkins conference information science. Johns Hopkins University, BaltimoreGoogle Scholar
  3. Baccelli F, Makowski AM, Shwartz A (1989) The fork-join queue and related systems with synchronization constraints. Adv Appl Probab 21: 629–660CrossRefGoogle Scholar
  4. Balsamo S, Donatiello L, van Dijk NM (1998) Bound performance models of heterogeneous parallel processing systems. IEEE Trans Parallel Distrib Syst 9: 1041–1056CrossRefGoogle Scholar
  5. Boxma O, Koole G, Liu Z (1994) Queueing-theoretic solution methods for models of parallel distributed systems. In: Performance evaluation of parallel and distributed systems. CWI Tract 105, Amsterdam, pp 1–24Google Scholar
  6. Brown L, Gans N, Mandelbaum A, Sakov A, Shen H, Zeltyn S, Zhao L (2005) Statistical analysis of a telephone call center: a queueing-science perspective. J Am Stat Assoc 100(469): 36–50CrossRefGoogle Scholar
  7. Cayirli T, Veral E (2003) Outpatient scheduling in health care: a review of literature. Prod Oper Manag 12(4): 519–549CrossRefGoogle Scholar
  8. de Kok A, Tijms H (1985) A two-moment approximation for a buffer design problem requiring a small rejection probability. Perform Eval 5: 77–84CrossRefGoogle Scholar
  9. Flatto L (1985) Two parallel queue created by arrivals with two demands II. SIAM J Appl Math 45: 861–878CrossRefGoogle Scholar
  10. Flatto L, Hahn S (1984) Two parallel queue created by arrivals with two demands I. SIAM J Appl Math 44: 1041–1053CrossRefGoogle Scholar
  11. Kemper B, Mandjes M (2009) Approximations for the mean sojourn time in a parallel queue. CWI report. http://oai.cwi.nl/oai/asset/13947/13947A.pdf
  12. Kemper B, de Mast J, Mandjes M (2010) Modelling process flow using diagrams. Qual Reliab Eng Int 26(4): 341–349Google Scholar
  13. Ko S, Serfozo RF (2008) Sojourn times in G/M/1 fork-join networks. Nav Res Logist 55: 432–443CrossRefGoogle Scholar
  14. Kühn P (1979) Approximate analysis of general queueing networks by decomposition. IEEE Trans Commun 27: 113–126CrossRefGoogle Scholar
  15. Nelson R, Tantawi AN (1988) Approximate analysis of fork/join synchronization in parallel queues. IEEE Trans Comput 37: 739–743CrossRefGoogle Scholar
  16. Stone C (1996) A course in probability and statistics. Duxbury Press, BelmontGoogle Scholar
  17. Tijms H (1986) Stochastic modelling and analysis—a computational approach. In: Wiley series in probability and mathematical statistics: applied probability and statistics. Wiley, ChichesterGoogle Scholar
  18. Varma S, Makowski AM (1994) Interpolation approximations for symmetric fork-join queues. Perform Eval 20: 245–265CrossRefGoogle Scholar
  19. Whitt W (1983) The queueing network analyzer. Bell Syst Tech J 62: 2779–2815Google Scholar

Copyright information

© The Author(s) 2011

Authors and Affiliations

  1. 1.Institute for Business and Industrial StatisticsUniversity of AmsterdamAmsterdamThe Netherlands
  2. 2.Department of Quantitative Economics, Faculty of Economics and BusinessUniversity of AmsterdamAmsterdamThe Netherlands
  3. 3.Korteweg-de Vries Institute for MathematicsUniversity of AmsterdamAmsterdamThe Netherlands
  4. 4.EURANDOMEindhovenThe Netherlands
  5. 5.CWIAmsterdamThe Netherlands

Personalised recommendations