The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1991 vol.40)
pp: 1301-1307
ABSTRACT
<p>Fault-tolerant computer systems may be evaluated by calculating their cumulative performance (e.g., number of processes jobs) over a finite mission time. A method for calculating the cumulative performance distribution assuming that the system fault-repair behavior can be modeled by a homogeneous Markov process is described. The method proposed for calculating the probability distribution of the accumulated reward over a finite mission is applicable to models of repairable and nonrepairable systems. The related solution algorithm shows a low polynomial computational complexity. The mathematical model is introduced, and the results already presented in the literature are surveyed. A comprehensive analysis of the time and space complexity of the proposed solution algorithm is presented. A numerical example is given.</p>
INDEX TERMS
repairable systems; time complexity; cumulative performance distribution; fault-tolerant computer systems; system fault-repair behavior; homogeneous Markov process; probability distribution; nonrepairable systems; low polynomial computational complexity; mathematical model; space complexity; computational complexity; fault tolerant computing; Markov processes; performance evaluation; probability.
CITATION
L. Donatiello, V. Grassi, "On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems", IEEE Transactions on Computers, vol.40, no. 11, pp. 1301-1307, November 1991, doi:10.1109/12.102838
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool