QUEUEING ANALYSIS OF FAULT-TOLERANT COMPUTER SYSTEMS.

Queueing models provide a useful tool for predicting the performance of many service systems including computer systems, telecommunication systems, computer/communication networks and flexible manufacturing systems. Traditional queueing models predict system performance under the assumption that all service facilities provide failure-free service. Earlier we have developed models to derive the distribution of job completion time in a failure-prone environment. In these models, we need to consider a possible loss of work due to the occurrence of a failure, i. e. , the interrupted job may be resumed or restarted upon service resumption. Note that the job completion time analysis includes the delays due to failures and repairs. The purpose of this paper is to extend our earlier analysis so as to account for the queueing delays. In effect, we consider an exact queueing analysis of fault-tolerant systems in order to obtain the steady-state distribution and the mean of the number of jobs in the system. In particular, we study a system in which jobs arrive in a Poisson fashion and are serviced according to FCFS discipline.

Duke Scholars

Author Kishor S. Trivedi Electrical and Computer Engineering