Title :
Performability analysis: a new algorithm
Author :
Nabli, Hédi ; Sericola, Bruno
Author_Institution :
IRISA, CNRS, Rennes, France
fDate :
4/1/1996 12:00:00 AM
Abstract :
We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm
Keywords :
Markov processes; computational complexity; fault tolerant computing; performance evaluation; Markov processes; computational complexity; fault tolerance; performability; performability analysis; performability distribution; performance; reliability; repairable systems; truncation steps; uniformization; Algorithm design and analysis; Computational complexity; Distributed computing; Fault tolerant systems; Markov processes; Performance analysis; Performance evaluation; Polynomials; Steady-state; Time measurement;
Journal_Title :
Computers, IEEE Transactions on
