Queueing Analysis of Faulttolerant Computer Systems
In this paper we consider the queueing analysis of a faulttolerant 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 analysis of the system and study the steadystate 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. Copyright © 1987 by the Institute of Electrical and Electronics Engineers, Inc.
Duke Scholars
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Software Engineering
- 4612 Software engineering
- 4606 Distributed computing and systems software
- 0906 Electrical and Electronic Engineering
- 0806 Information Systems
- 0803 Computer Software
Citation
Published In
DOI
ISSN
Publication Date
Volume
Issue
Start / End Page
Related Subject Headings
- Software Engineering
- 4612 Software engineering
- 4606 Distributed computing and systems software
- 0906 Electrical and Electronic Engineering
- 0806 Information Systems
- 0803 Computer Software