Abstract
In this paper the fork–join queueing system with M parallel servers is considered. For M = 2 and state–dependent arrival and service rates, a set of recursive equations of steady–state probabilities and the moments of task waiting time in each queue are obtained. For arbitrary M, the stability condition, the Lindley integral equation for task waiting time and the distribution of synchronization delay are given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
