A realistic evaluation of consistency algorithms for replicated files
ANSS '88 Proceedings of the 21st annual symposium on Simulation
The Completion Time of Programs on Processors Subject to Failure and Repair
IEEE Transactions on Computers
Performance under failures of high-end computing
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Analysis of stochastic reaction networks with Markov reward models
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Job completion time on a virtualized server with software rejuvenation
ACM Journal on Emerging Technologies in Computing Systems (JETC) - Special Issue on Reliability and Device Degradation in Emerging Technologies and Special Issue on WoSAR 2011
| Hi-index | 0.01 |
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.