By Topic

Analysis of the fork-join queue

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. Kim ; Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA ; A. K. Agrawala

A fork-join queue is considered as a typical model of parallel processing systems with arrival and departure synchronizations. An approach for obtaining the transient and the steady-state solutions of the fork-join queue in terms of the virtual waiting times, which can be used to obtain the response time and the delay between the fork and the join instants, is presented. With the restriction of the service time being the Erlangian distribution, the formulations result in a form of a series, the worth of which is in actually computing numerical results. The joint-state-occupancy probabilities can be easily deduced from the results. The approximate solutions in the steady state are presented for the cases where the interarrival time distributions are exponential and hyperexponential, and the service-time distributions are exponential and two-state Erlangian. The parallelism achievable with synchronization constraints is examined from the approximations

Published in:

IEEE Transactions on Computers  (Volume:38 ,  Issue: 2 )