Issue No.06 - June (1990 vol.39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.53605
<p>It is shown that the (scaled) conditional moments of performability in Markov models are the states of a cascaded, linear, continuous-time dynamic system with identical system matrices in each stage. This interpretation leads to a simple method of computing the first moment for nonhomogeneous Markov models with finite mission time. In addition, the cascaded system representation leads to the derivation of a set of two stable algorithms for propagating the conditional moments of performability in homogeneous Markov models. In particular, a very fast doubling algorithm using diagonal Pade approximation to compute the matrix exponential and repeated squaring is derived. The algorithms are widely recognized, to be superior to those based on eigenvalue analysis in terms of both the computational efficiency and stability. The algorithms have obvious implications in solving reliability/availability models with large mission times.</p>
scaled conditional moments; computational aspects; performability models; fault-tolerant computer systems; Markov models; continuous-time dynamic system; finite mission time; cascaded system representation; stable algorithms; doubling algorithm; diagonal Pade approximation; reliability; availability models; approximation theory; fault tolerant computing; Markov processes.
K.R. Pattipati, S.A. Shah, "On the Computational Aspects of Performability Models of Fault-Tolerant Computer Systems", IEEE Transactions on Computers, vol.39, no. 6, pp. 832-836, June 1990, doi:10.1109/12.53605