The Completion Time of Programs on Processors Subject to Failure and Repair

TitleThe Completion Time of Programs on Processors Subject to Failure and Repair
Publication TypeJournal Article
Year of Publication1993
AuthorsPF Chimento
JournalIeee Transactions on Computers
Volume42
Start Page1184
Issue10
Pagination1184 - 1194
Date Published01/1993
Abstract

The objective of this paper is to 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. We derive a closed-form expression for the Laplace-Stieltjes transform (LST) of the time to completion distribution of programs on such systems. We then describe an effective numerical procedure for computing the completion time distribution. We show how these results apply to the analysis of different computer system structures and organizations of fault-tolerant systems. Finally, we use numerical solution methods to find the distribution of time to completion on several systems. © 1993 IEEE

DOI10.1109/12.257705
Short TitleIeee Transactions on Computers