Issue No. 10 - October (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.257705
<p>The authors describe a technique for computing the distribution of the completion time of a program on a server subject to failure and repair. Several realistic aspects of the system are included in the model. The server behavior is modeled by a semi-Markov process in order to accommodate nonexponential repair-time distributions. More importantly, the effect on the job completion time of the work lost due to the occurrence of a server failure is modeled. They derive a closed-form expression for the Laplace-Stieltjes transform (LST) of the time to completion distribution of programs on such systems. They then describe an effective numerical procedure for computing the completion time distribution. They show how these results apply to the analysis of different computer system structures and organizations of fault-tolerant systems. Finally, they use numerical solution methods to find the distribution of time to completion on several systems.</p>
server behavior; semi-Markov process; nonexponential repair-time distributions; job completion time; closed-form expression; Laplace-Stieltjes transform; fault-tolerant system; computer performance; failure-repair models; multistate computer systems; preemptions; fault tolerant computing; Laplace transforms; Markov processes; performance evaluation.
K. Trivedi and P. Chimento, "The Completion Time of Programs on Processors Subject to Failure and Repair," in IEEE Transactions on Computers, vol. 42, no. , pp. 1184-1194, 1993.