Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Rubino, G. ; Inst. Nat. de Recherche en Inf. et Autom., Rennes, France ; Sericola, B.

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

Published in:

Computers, IEEE Transactions on  (Volume:44 ,  Issue: 2 )