Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Analytical results for waiting time and system size distributions in two parallel queueing systems
SIAM Journal on Applied Mathematics
A performance evaluation of several priority policies for parallel processing systems
Journal of the ACM (JACM)
Interpolation approximations for symmetric Fork-Join queues
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
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
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
Triggered Concurrent Batch Arrivals and Batch Departuresin Queueing Networks
Discrete Event Dynamic Systems
Queueing Network Models for Parallel Processing with Asynchronous Tasks
IEEE Transactions on Computers
Synchronized queues with deterministic arrivals
Operations Research Letters
Hi-index | 0.00 |
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.