Queueing Analysis of Fault-Tolerant Computer Systems

Author

Nicola, Victor F. ; Kulkarni, Vidyadhar G. ; Trivedi, Kishor S.

Author_Institution

Department of Computer Science, Duke University

Issue

3

fYear

1987

fDate

3/1/1987 12:00:00 AM

Firstpage

363

Lastpage

375

Abstract

In this paper we consider the queueing analysis of a fault-tolerant computer system. The failure/repair behavior of the server is modeled by an irreducible continuous-time Markov chain. Jobs arrive in a Poisson fashion to the system and are serviced according to FCFS discipline. A failure may cause the loss of the work already done on the job in service, if any; in this case the interrupted job is repeated as soon as the server is ready to deliver service. In addition to the delays due to failures and repairs, jobs suffer delays due to queueing. We present an exact queueing analysig of the system and study the steady-state behavior of the number of jobs in the system. As a numerical example, we consider a system with two processors subject to failures and repairs.

Keywords

Fault-tolerant systems; performance models; queueing theory; reliability analysis; Availability; Computer aided manufacturing; Delay; Electric breakdown; Fault tolerant systems; Performance analysis; Predictive models; Queueing analysis; Reliability theory; Steady-state; Fault-tolerant systems; performance models; queueing theory; reliability analysis;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1987.233168

Filename

1702223