Abstract
Continuous-time Markov processes with a finite-state space are generally considered to model degradable fault-tolerant computer systems. The finite space is partitioned as ∪ m i=1 B i , where B i stands for the set of states which corresponds to the configuration where the system has a performance level (or reward rate) equal to τ i . The performability Y t is defined as the accumulated reward over a mission time [0, t]. In this paper, a renewal equation is established for the performability measure and solved for both “standard” and uniform acyclic models. Two closed form expressions for the performability measure are derived for the two types of models. Furthermore, an algorithm with a low polynomial computational complexity is presented and applied to a degradable computer system.
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.
