Interval availability analysis using denumerable Markov processes: application to multiprocessor subject to breakdowns and repair

Interval availability is a dependability measure defined by the fraction of time during which a system is operational over a finite observation period. The computation of its distribution allows the user to ensure that the probability that its system will achieve a given availability level is high e...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 44; no. 2; pp. 286 - 291
Main Authors Rubino, G., Sericola, B.
Format Journal Article
LanguageEnglish
Published IEEE 01.02.1995
Subjects
Availability
Distributed computing
Electric breakdown
Markov processes
Multiprocessing systems
Particle measurements
Queueing analysis
State-space methods
Time measurement
Transient analysis
Online AccessGet full text
ISSN0018-9340
DOI10.1109/12.364539

Cover

More Information
Summary:Interval availability is a dependability measure defined by the fraction of time during which a system is operational over a finite observation period. The computation of its distribution allows the user to ensure that the probability that its system will achieve a given availability level is high enough. The system is assumed to be modeled as a Markov process with countable state space. We propose a new algorithm to compute the interval availability distribution. One of its main advantages is that, in some cases, it applies even to infinite state spaces. This is useful, for instance, in case of models taking into account contention with unbounded buffers. This important feature is illustrated on models of multiprocessor systems, subject to breakdowns and repair. When the model is finite, we show through a numerical example that the new technique can perform very well.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.364539