Performability analysis: a new algorithm

DOI10.1109/12.494108MaRDI QIDQ4420951zbMATH OpenOpenAlexFDO

Authors Hédi Nabli, Bruno Sericola

Publication date 1996

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.494108

zbMATH Keywords

fault toleranceMarkov processesreliabilityrepairable systemsuniformization

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Performability analysis for degradable computer systems
• Performability: Asymptotic distribution and moment computation
• Evaluation of Performability for Degradable Computer Systems
• Performability of the hypercube (reliability)
• Performability analysis of computer systems: from model specification to solution

Cited in

(9)

• Moments' analysis in homogeneous Markov reward models
• Performance estimates for applications: An algebraic framework
• Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
• Performability analysis for degradable computer systems
• Performability measure for acyclic Markovian models
• Performability: Asymptotic distribution and moment computation
• Stationary analysis of a fluid queue driven by some countable state space Markov chain
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization

This page was built for publication: Performability analysis: a new algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420951)