DocumentCode
1013475
Title
The completion time of programs on processors subject to failure and repair
Author
Chimento, Philip F., Jr. ; Trivedi, K.S.
Author_Institution
IBM Corp., Research Triangle Park, NC, USA
Volume
42
Issue
10
fYear
1993
fDate
10/1/1993 12:00:00 AM
Firstpage
1184
Lastpage
1194
Abstract
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
Keywords
Laplace transforms; Markov processes; fault tolerant computing; performance evaluation; Laplace-Stieltjes transform; closed-form expression; computer performance; failure-repair models; fault-tolerant system; job completion time; multistate computer systems; nonexponential repair-time distributions; preemptions; semi-Markov process; server behavior; Availability; Closed-form solution; Computer performance; Distributed computing; Fault tolerant systems; Hardware; Laplace equations; Real time systems; Resumes; Steady-state;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.257705
Filename
257705
Link To Document