Article

Free access

Bounding availability of repairable computer systems

Authors:

E. de Souza e Silva,

A. GoyalAuthors Info & Claims

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Pages 29 - 38

https://doi.org/10.1145/75108.75376

Published: 01 April 1989 Publication History

Abstract

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state space cardinalities that are so large that it is impractical to generate the transition rate matrix let alone solve for availability measures. Various state space reduction methods have been developed, particularly for transient analysis. In this paper we present an approximation technique for determining steady state availability. Of particular interest is that the method also provides bounds on the error. Examples are given to illustrate the method.

References

[1]

S. Berson, E. de Souza e Silva and R.R. Muntz, "An Object Oriented Methodology for the Specification of Ma~kov Models", UCI, A Tech. Report CSD-870030, June 1987 (revised February 1988).

[2]

J.A. Carrasco, J. Figueras, "METFAC" Design and Implementation of a Software Toll for Modeling and Evaluation of Complex Fault-Tolerant Computing Systems," Proceedings of FTC8.16 pp. 424- 429, July 1986

[3]

A. E. Conway and A. Goyal "Monte Carlo Simulation of Computer System Availability/Reliability Models", Proceedings of FTC$-17 1987.

[4]

A. Costes, J.E. Doucet, C. Landrault, and J.C. Laprie, "SURF: A Program for Dependability Evaluation of Complex Fault-Tolerant Computing Systems," Proceeding~ of FTCS-11 pp. 72-78, June 1981.

[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" JA CM"' vol. 31, No. 4, pp. 804-825, October 1984.

Digital Library

[7]

P - J. Courtois and P Semal, "Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chanins and Queueing Models" IEEE JSA C, vol SAC-4, No. 6, September 1986.

[8]

P.-J. Courtois and P. Semal, "Bounds on Conditional Steady-State Distributions in Large Markovian and Queueing Models", Tele$ra~c Anal. and Computer Perf. Eval., O.J. Boxma, J.W. Cohen and H.C. Tijms editors, North Holland, 1986.

Digital Library

[9]

E. de Souza e Silva and H.R. Gaff, "Calculating Cumulative Operational Time Distributions of Repairable Computer Systems", IEEE. TC vol. C- 35, no. 4, pp. 322-332, April 1986.

Digital Library

[10]

Dragomir D. Dimitrijevic and Mon-Song Chen, "An Integrated Algorithm for Probabilistic Protocol Verification and Evaluation", IBM Res. Rep. RC 13901 (#6~70) 19 p., 8/4/88.

[11]

R. Geist and K. S. Trivedi, "Ultra-ttigh Reliability Prediction for Fault-Tolerant Computer Systems", IEEE-TC, C-32, 12, pp. 1118-1127, Dec. 1985.

[12]

A. Goyal, "System Availability Estimator (SAVE)" XBM Res. R~p. 1tO ~517 (#56~87) 37 p., 2/ls/87.

[13]

A. Goyal, W.C. Carter, E. de Souza e Silva, S.S. Lavenberg and K.S. Trivedi, "The System Availability Estimator", Proceedings of FTCS-16, Vienna, pp. 84-89, July 1986.

[14]

A. Goyal, S.S. Lavenberg and K.S. Trivedi, "Probabilistic Modeling of Computer System Availability", Ann. of 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.

Digital Library

[16]

P. Heidelberger and A. Goyal, "Sensitivity Analysis of Continuous Time Markov Chains Using Uniformization", Proc. of the ~nd intl. Workshop on Applied Math. and Perf./Reliability Models of Computer/Comm. Systems, Rome, Italy, May 1987.

[17]

K.B. Iratfi and V.L. Wallace, "On Network Linguistics and the Conversational Design of Queueing Networks," JA CM, vol. 18, no. 4, pp. 616-629, October 1971.

Digital Library

[18]

E. E. Lewis and F. Bohm, "Monte Carlo Simulation of Markov Unreliability Models", Nuclear Engineering and Design", 77, 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," Proceedings of FTCS-I$ pp. 276-274, June 1982.

[20]

B. Plateau, "On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms", Proc. of Sigmetric~ Conference, 1985.

Digital Library

[21]

P. Semal and P- J. Courtois, "Stability Analysis of Large Markov Chains", PERFORMANCE '87, pp.363-382, 1988.

Digital Library

[22]

G.W. Stewart, "Computable Error Bounds for Aggregated Markov Chains", JACM, vol. 30, No. 2, pp. 271-285, April 1983.

Digital Library

[23]

K.S. Trivedi, "Probability &: Statistics with Reliability, Queuing and Computer Science Applications", Prentice Hall, 1982.

Digital Library

[24]

K.S. Tdvedi, J.B. Dugan, R.R. Geist, and M.K. Smotherman, "Hybrid Reliability Modeling of Fault-Tolerant Computer Systems," Comput. Elec. Eng., Vol. 11, pp. 87-108 1984.

Digital Library

Cited By

Dayar THermanns HSpieler DWolf V(2011)Bounding the equilibrium distribution of Markov population modelsNumerical Linear Algebra with Applications10.1002/nla.79518:6(931-946)Online publication date: 18-Oct-2011
https://doi.org/10.1002/nla.795
Golubchik LLui J(2002)Bounding of Performance Measures for Threshold-Based Queuing SystemsIEEE Transactions on Computers10.1109/12.99544551:4(353-372)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1109/12.995445
Golubchik LLui J(1997)Bounding of performance measures for a threshold-based queueing system with hysteresisACM SIGMETRICS Performance Evaluation Review10.1145/258623.25868425:1(147-157)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/258623.258684
Show More Cited By

Recommendations

Bounding availability of repairable computer systems

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state space cardinalities that are so large that it is impractical to generate the transition rate matrix let alone solve for ...
Bounding Availability of Repairable Systems

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state-space cardinalities that are so large that it is impractical to generate the transition-rate matrix let alone solve ...
Computing bounds on steady state availability of repairable computer systems

One of the most important performance measures for computer system designers is system availability. Most often, Markov models are used in representing systems for dependability/availability analysis. Due to complex interactions between components and ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '89: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

April 1989

242 pages

ISBN:0897913159

DOI:10.1145/75108

Chairman:
Domenico Ferrari
Univ. of California, Berkeley

ACM SIGMETRICS Performance Evaluation Review Volume 17, Issue 1
May 1989
209 pages
ISSN:0163-5999
DOI:10.1145/75372
Editor:
Blaine D. Gaither
Gould Inc., San Diego, CA
Issue’s Table of Contents

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMETRICS89

Sponsor:

SIGMETRICS

SIGMETRICS89: Performance 89 Intl Conference on Measurement & Modeling of Computer Systems

May 23 - 26, 1989

California, Oakland, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
486
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dayar THermanns HSpieler DWolf V(2011)Bounding the equilibrium distribution of Markov population modelsNumerical Linear Algebra with Applications10.1002/nla.79518:6(931-946)Online publication date: 18-Oct-2011
https://doi.org/10.1002/nla.795
Golubchik LLui J(2002)Bounding of Performance Measures for Threshold-Based Queuing SystemsIEEE Transactions on Computers10.1109/12.99544551:4(353-372)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1109/12.995445
Golubchik LLui J(1997)Bounding of performance measures for a threshold-based queueing system with hysteresisACM SIGMETRICS Performance Evaluation Review10.1145/258623.25868425:1(147-157)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/258623.258684
Golubchik LLui JZahorjan JGreenberg A(1997)Bounding of performance measures for a threshold-based queueing system with hysteresisProceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems10.1145/258612.258684(147-157)Online publication date: 1-Jun-1997
https://dl.acm.org/doi/10.1145/258612.258684
Somani ASandadi UTwigg DSharma T(1995)An efficient decomposition technique for Markov-chain analysisAnnual Reliability and Maintainability Symposium 1995 Proceedings10.1109/RAMS.1995.513286(465-471)Online publication date: 1995
https://doi.org/10.1109/RAMS.1995.513286
Semal P(1995)Refinable Bounds for Large Markov ChainsIEEE Transactions on Computers10.1109/12.46769644:10(1216-1222)Online publication date: 1-Oct-1995
https://dl.acm.org/doi/10.1109/12.467696
Kamal A(1993)Analysis of the semisynchronous carrier sense multiple access on the bus topologyIEEE Transactions on Communications10.1109/26.24174441:11(1635-1646)Online publication date: Jan-1993
https://doi.org/10.1109/26.241744
Ciardo GMuppala JTrivedi K(1990)SPNP: stochastic Petri net packageProceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM8910.1109/PNPM.1989.68548(142-151)Online publication date: 1990
https://doi.org/10.1109/PNPM.1989.68548
Avritzer AGerla MRibeiro BCarlyle JKarplus W(1990)The advantage of dynamic tuning in distributed asymmetric systemsProceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration10.1109/INFCOM.1990.91326(811-817)Online publication date: 1990
https://doi.org/10.1109/INFCOM.1990.91326
Heimann DMittal NTrivedi K(1990)Availability and Reliability Modeling for Computer SystemsAdvances in Computers Volume 3110.1016/S0065-2458(08)60154-0(175-233)Online publication date: 1990
https://doi.org/10.1016/S0065-2458(08)60154-0
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents