Narahari, Y and Sundarrajan, P (1995) Performability Analysis of Fork-Join Queueing Systems. In: Journal of the Operational Research Society, 46 (10). pp. 1237-1249.
Performability_Analysis.pdf - Published Version
Restricted to Registered users only
Download (355Kb) | Request a copy
Fork-join queueing systems offer a natural modelling paradigm for parallel processing systems and for assembly operations in automated manufacturing. The analysis of fork-join queueing systems has been an important subject of research in recent years. Existing analysis methodologies-both exact and approximate-assume that the servers are failure-free. In this study, we consider fork-join queueing systems in the presence of server failures and compute the cumulative distribution of performability with respect to the response time of such systems. For this, we employ a computational methodology that uses a recent technique based on randomization. We compare the performability of three different fork-join queueing models proposed in the literature: the distributed model, the centralized splitting model, and the split-merge model. The numerical results show that the centralized splitting model offers the highest levels of performability, followed by the distributed splitting and split-merge models.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Palgrave Publishers Ltd..|
|Keywords:||fork-join queueing systems;parallel processing systems; automated assembly systems|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||23 May 2011 10:08|
|Last Modified:||23 May 2011 10:08|
Actions (login required)