DocumentCode
3040388
Title
Interval availability distribution computation
Author
Rubino, Gerardo ; Sericola, Bruno
Author_Institution
IRISA-INRIA, Rennes, France
fYear
1993
fDate
22-24 June 1993
Firstpage
48
Lastpage
55
Abstract
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its distribution allows the user to ensure that the probability that a system will achieve a given availability level is high enough. As usual, the system is assumed to be modeled by a finite Markov process. The authors propose two new algorithms to compute this measure and compare them with respect of the input parameters of the model, both through the storage requirement and the execution time points of view. It is shown that one of them is an improvement of a well-known one. Both algorithms are based on the uniformization technique.
Keywords
fault tolerant computing; availability level; dependability measure; finite Markov process; finite observation period; internal availability distribution computation; storage requirement; uniformization technique; Approximation methods; Availability; Distributed computing; Markov processes; Particle measurements; Random variables; State-space methods; Steady-state; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1993. FTCS-23. Digest of Papers., The Twenty-Third International Symposium on
Conference_Location
Toulouse, France
ISSN
0731-3071
Print_ISBN
0-8186-3680-7
Type
conf
DOI
10.1109/FTCS.1993.627307
Filename
627307
Link To Document