Skip to main content Accesibility Help


  • Jun Li (a1) and Yiqiang Q. Zhao (a2)

In this article, we consider the two-node fork-join model with a Poisson arrival process and exponential service times of heterogeneous service rates. Using a mapping from the queue lengths in the parallel nodes to the join queue length, we first derive the probability distribution function of the join queue length in terms of joint probabilities in the parallel nodes and then study the exact tail asymptotics of the join queue length distribution. Although the asymptotics of the joint distribution of the queue lengths in the parallel nodes have three types of characterizations, our results show that the asymptotics of the join queue length distribution are characterized by two scenarios: (1) an exact geometric decay and (2) a geometric decay with the prefactor n−1/2.

Hide All
1.Ayhan, H. & Kim, J.K. (2007). A general class of closed fork and join queues with subexponential service times. Stochastic Models 23: 523535.
2.Baccelli, F. (1985). Two parallel queues created by arrivals with two demands: The M/G/2 symmetrical case. Technical report 426, INRIA-Rocquencourt.
3.Baccelli, F., Makowski, A.M., & Shwartz, A. (1989). The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Advances in Applied Probability 21: 629660.
4.Chao, X. & Zheng, S. (2000). Triggered concurrent batch arrivals and batch departures in queueing networks. Discrete Event Dynamic Systems 10: 115129.
5.Chen, R.J. (2001). A hybrid solution of fork/join synchronization in parallel queues. IEEE Transactions on Parallel and Distributed Systems 12: 829845.
6.Flatto, L. (1985). Two parallel queues created by arrivals with two demands II. SIAM Journal on Applied Mathematics 45: 861878.
7.Flatto, L. & Hahn, S. (1984). Two parallel queues created by arrivals with two demands I. SIAM Journal on Applied Mathematics 44: 10411053.
8.Heidelberger, P. & Trivedi, K.S. (1983). Queueing network models for parallel processing with asynchronous tasks. IEEE Transactions on Computers 32: 7382.
9.Ko, S.S. & Serfozo, R.F. (2004). Response times in M/M/s fork-join networks. Advances in Applied Probability 36: 854871.
10.Nelson, R. & Tantawi, A.N. (1988). Approximate analysis of fork/join synchronization in parallel queues. IEEE Transactions on Computers 37: 739743.
11.Nelson, R. & Towsley, D. (1993). A performance evaluation of several priority policies for parallel processing systems. Journal of the ACM 40: 714740.
12.Pinotsi, D. & Zazanis, M.A. (2005). Synchronized queues with deterministic arrivals. Operations Research Letters 33: 560566.
13.Song, J.S., Xu, S.H., & Liu, B. (1999). Order-fulfillment performance measures in an assemble-to-order system with stochastic leadtimes. Operations Research 47: 131149.
14.Shwartz, A. & Weiss, A. (1993). Induced rare events: analysis via large deviations and time reversal. Advances in Applied Probability 25: 667689.
15.Tan, X. & Knessl, C. (1996). A fork-join queueing model: Diffusion approximation, integral representations and asymptotics. Queueing Systems 22: 287322.
16.Varki, E. (1999). Mean value technique for closed fork-join networks. ACM SIGMETRICS Performance Evaluation Review 27: 103112.
17.Varma, S. & Makowski, A.M. (1994). Interpolation approximation for symmetric fork-join queues. Performance Evaluation 20: 245265.
18.Wright, P.E. (1992). Two parallel queues with coupled inputs. Advances in Applied Probability 24: 9861007.
19.Zhang, Z. (1990). Analytical results for waiting time and system size distributions in two parallel queueing systems. SIAM Journal on Applied Mathematics 50: 11761193.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed