Abstract
Abstract : Fault-tolerant computer systems change their level of performance (e. g., mode of operation or service rate) in response to different events such as failure, degradation or repair. We present a unified model for the analysis of job (task) completion time and the accumulated service (Reward) until a given time (also known as performability). In prior work, the evaluation of the distribution of performability was restricted to nonrepairable systems (represented by acyclic Markov chains). In this paper, we describe an algorithm for the numerical evaluation of the distributions of performability or job completion time, in repairable fault-tolerant systems (represented by cyclic Markov chains). We demonstrate the feasibility of our techniques by means of numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
