Bounding Availability of Repairable Computer Systems

IEEE Transactions on Computers

Volumn 38, Issue 12, 1989, Pages 1714-1723

  Muntz, Richard R ^a   De Souza E Silva, Edmundo ^b   Goyal, Ambuj ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Availability; bounds; decomposition; dependability; Markov chain; state space reduction

Indexed keywords

PROBABILITY--RANDOM PROCESSES;

AVAILABILITY; MARKOV PROCESSES; REPAIRABLE COMPUTER SYSTEMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024928611     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.40849     Document Type: Article

References (26)

1. S. Berson, E. de Souza e Silva, and R.R. Muntz, “An object oriented methodology for the specification of Markov models,” UCLA Tech. Rep. CSD-870030, June 1987 (revised Feb. 1988).
2. J.A. Carrasco and J. Figueras, “METFAC: Design and implementation of a software toll for modeling and evaluation of complex faulttolerant computing systems,” in Proc. FTCS-16, July 1986, pp. 424–429.
3. A.E. Conway and A. Goyal, “Monte Carlo simulation of computer system availability/reliability models,” in Proc. FTCS-17, 1987.
4. A. Costes, J.E. Doucet, C. Landrault, and J.C. Laprie, “SURF: A program for dependability evaluation of complex faulttolerant computing systems,” in Proc. FTCS-11, June 1981, pp. 72–78.
5. P.-J. Courtois, Decomposability: Queueing and Computer System Application. New York: Academic, 1977.
6. P.-J. Courtois and P. Semal, “Bounds for the positive eigenvectors of nonnegative matrices and for their approximations,” J. ACM, vol. 31, no. 4, pp. 804–825, Oct. 1984.
7. P.-J. Courtois and P. Semal, “Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models,” IEEE J. Select. Areas Commun., vol. SAC-4, no. 6, Sept. 1986.
8. P.-J. Courtois and P. Semal, “Bounds on conditional steady-state distributions in large Markovian and queueing models,” in Teletraffic Analysis and Computer Performance Evaluation, O.J. Boxma, J.W. Cohen, and H.C. Tijms, Eds. New York: North Holland, 1986.
9. E. de Souza e Silva and H.R. Gail, “Calculating cumulative operational time distributions of repairable computer systems,” IEEE Trans. Comput., vol. C-35, no. 4, pp. 322–332, Apr. 1986.
10. D.D. Dimitrijevic and M.-S. Chen, “An integrated algorithm for probabilistic protocol verification and evaluation,” IBM Res. Rep. RC 13901 (#62470), p. 19, Aug. 4, 1988.
11. R. Geist and K.S. Trivedi, “Ultrahigh reliability prediction for faulttolerant computer systems,” IEEE Trans. Comput., vol. C-32, no. 12, pp. 1118–1127, Dec. 1985.
12. A. Goyal, “System availability estimator (SAVE),” IBM Res. Rep. RC 12517 (#56267) p. 37, Feb. 18, 1987.
13. A. Goyal, W.C. Carter, E. de Souza e Silva, S.S. Lavenberg, and K.S. Trivedi, “The system availability estimator,” in Proc. FTCS-16, Vienna, Austria, July 1986, pp. 84–89.
14. A. Goyal, S.S. Lavenberg, and K.S. Trivedi, “Probabilistic modeling of computer system availability,” Ann. Oper. Res., vol. 8, pp. 285–306, 1986.
15. D. Gross and D.R. Miller, “The randomization technique as a modeling tool and solution procedure for transient Markov processes,” Oper. Res., vol. 32, no. 2, pp. 343–361, 1984.
16. P. Heidelberger and A. Goyal, “Sensitivity analysis of continuous time Markov chains using uniformization,” in Proc. 2nd Int. Workshop Appl. Math. Perform. Reliability Models Comput. Commun. Syst., Rome, Italy, May 1987.
17. K.B. Irani and V.L. Wallace, “On network linguistics and the conversational design of queueing networks,” J. ACM, vol. 18, no. 4, pp. 616–629, Oct. 1971.
18. E.E. Lewis and F. Bohm, “Monte Carlo simulation of Markov unreliability models,” Nucl. Eng. Design, vol. 77, no. 1, pp. 49–62, 1984.
19. S.V. Makam and A. Avizienis, “ARIES 81: A reliability and life-cycle evaluation tool for fault tolerant systems,” in Proc. FTCS-12, June 1982, pp. 276–274.
20. B. Plateau, “On the stochastic structure of parallelism and synchronization models for distributed algorithms,” in Proc. Sigmetrics Conf., 1985.
21. A.L. Reibman and K.S. Trivedi, “Numerical transient analysis of Markov models,” Comput. Oper. Res., vol. 15, no. 1, pp. 19–36, 1988.
22. P. Semal and P.-J. Courtois, “Stability analysis of large Markov chains,” Performance ′87, pp. 363–382, 1988.
23. G.W. Stewart, “Computable error bounds for aggregated Markov chains,” J. ACM, vol. 30, no. 2, pp. 271–285, Apr. 1983.
24. W.J. Stewart and A. Goyal, “Matrix methods in large dependability models,” IBM Res. Rep. RC 11485, IBM T.J. Watson Res. Center, 1985.
25. K.S. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
26. K.S. Trivedi, J.B. Dugan, R.R. Geist, and M.K. Smotherman, “Hybrid reliability modeling of faulttolerant computer systems,” Comput. Elec. Eng., vol. 11, pp. 87–108, 1984.