Abstract
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
