Computing bounds on steady state availability of repairable computer systems
From MaRDI portal
Publication:4310840
DOI10.1145/179812.179848zbMath0812.68059OpenAlexW2031305654MaRDI QIDQ4310840
John C. S. Lui, Richard R. Muntz
Publication date: 14 May 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/179812.179848
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
GENERALIZED CLASS [script C MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS] ⋮ Sub-stochastic matrix analysis for bounds computation -- theoretical results ⋮ A preorder relation for Markov reward processes ⋮ Stochastic Bounds with a Low Rank Decomposition ⋮ Bounding reward measures of Markov models using the Markov decision processes ⋮ Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations
This page was built for publication: Computing bounds on steady state availability of repairable computer systems
