This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Availability Analysis of Repairable Computer Systems and Stationarity Detection
November 1999 (vol. 48 no. 11)
pp. 1166-1172

Abstract—Point availability and expected interval availability are dependability measures respectively defined by the probability that a system is in operation at a given instant and by the mean percentage of time during which a system is in operation over a finite observation period. We consider a repairable computer system and we assume, as usual, that the system is modeled by a finite Markov process. We propose in this paper a new algorithm to compute these two availability measures. This algorithm is based on the classical uniformization technique in which a test to detect the stationary behavior of the system is used to stop the computation if the stationarity is reached. In that case, the algorithm gives not only the transient availability measures, but also the steady state availability, with significant computational savings, especially when the time at which measures are needed is large. In the case where the stationarity is not reached, the algorithm provides the transient availability measures and bounds for the steady state availability. It is also shown how the new algorithm can be extended to the computation of performability measures.

[1] E. de Souza e Silva and H.R. Gail, “Calculating Cumulative Operational Time Distributions of Repairable Computer Systems,” IEEE Trans. Computers, vol. 35, no. 4, pp. 322-332, Apr. 1986.
[2] G. Rubino and B. Sericola, “Interval Availability Distribution Computation,” Proc. IEEE 23rd Fault-Tolerant Computing Symp., pp. 49-55, Toulouse, France, June 1993.
[3] G. Rubino and B. Sericola, “Interval Availability Analysis Using Denumerable Markov Processes: Application to Multiprocessor Subject to Breakdowns and Repair,” IEEE Trans. Computers, vol. 44, no. 2, pp. 286-291, Feb. 1995.
[4] G. Ciardo, A. Blakemore, P.F. Chimento, J. K. Muppala, and K.S. Trivedi, “Automated Generation and Analysis of Markov Reward Model Using Stochastic Reward Nets,” Linear Algebra, Markov Chains, and Queueing Models, C.D. Meyer and E.R.J. Plemmons, eds., pp. 145-191, Springer-Verlag, 1993.
[5] M. Malhotra, J.K. Muppala, and K.S. Trivedi, “Stiffness-Tolerant Methods for Transient Analysis of Stiff Markov Chains,” Microelectronics and Reliability, vol. 34, no. 11, pp. 1,825-1,841, 1994.
[6] S.M. Ross, Stochastic Processes. John Wiley&Sons, 1983.
[7] P.N. Bowerman, R.G. Nolty, and E.M. Scheuer, “Calculation of the Poisson Cumulative Distribution Function,” IEEE Trans. Reliability, vol. 39, pp. 158-161, 1990.
[8] J.F. Meyer, “Closed-Form Solutions for Performability,” IEEE Trans. Computers, vol. 31, no. 7, pp. 648-657, July 1982.
[9] B.R. Iyer, L. Donatiello, and P. Heidelberger, “Analysis of Performability for Stochastic Models of Fault-Tolerant Systems,” IEEE Trans. Computers, vol. 35, no. 10, pp. 902-907, Oct. 1986.
[10] V.G. Kulkarni, V.F. Nicola, R.M. Smith, and K.S. Trivedi, “Numerical Evaluation of Performability and Job Completion Time in Repairable Fault-Tolerant Systems,” Proc. IEEE 16th Fault-Tolerant Computing Symp., pp. 252-257, Vienna, Austria, July 1986.
[11] G. Ciardo, R. Marie, B. Sericola, and K.S. Trivedi, “Performability Analysis Using Semi-Markov Reward Processes,” IEEE Trans. Computers, vol. 39, no. 10, pp. 1,251-1,264, Oct. 1990.
[12] R.M. Smith, K.S. Trivedi, and A.V. Ramesh, “Performability Analysis: Measures, an Algorithm, and a Case Study,” IEEE Trans. Computers, vol. 37, no. 4, pp. 406-417, Apr. 1988.
[13] H. Nabli and B. Sericola, “Performability Analysis: A New Algorithm,” IEEE Trans. Computers, vol. 45, no. 4, pp. 491-495, Apr. 1996.
[14] E. de Souza e Silva and H.R. Gail, “Calculating Availability and Performability Measures of Repairable Computer Systems Using Randomization,” J. ACM, vol. 36, pp. 171-193, Jan. 1989.
[15] J.F. Meyer, “On Evaluating the Performability of Degradable Computing Systems,” IEEE Trans. Computers, vol. 29, no. 8, pp. 720-731, Aug. 1980.

Index Terms:
Repairable computer systems, dependability, availability, performability, Markov processes, stationarity detection.
Citation:
Bruno Sericola, "Availability Analysis of Repairable Computer Systems and Stationarity Detection," IEEE Transactions on Computers, vol. 48, no. 11, pp. 1166-1172, Nov. 1999, doi:10.1109/12.811102
Usage of this product signifies your acceptance of the Terms of Use.