Copyright © 2004 Elsevier B.V. All rights reserved.
Iterative convergence of passage-time densities in semi-Markov performance models
Available online 8 December 2004.
Abstract
Passage-time densities are important for the detailed performance analysis of distributed computer and communicating systems. We provide a proof and demonstration of a practical iterative algorithm for extracting complete passage-time densities from expressive semi-Markov systems. We end by showing its application to a distributed web-server cluster model of 15.9 million states.
Keywords: Passage-time density; Iterative algorithm; Analytic performance modelling; Semi-Markov process; Stochastic Petri nets
Article Outline
- 1. Introduction
- 2. Background theory
- 2.1. Semi-Markov processes
- 2.2. First passage-times
- 2.3. Iterative algorithm for evaluating passage-times
- 3. Proof of convergence and correctness
- 3.1. Technical summary
- 3.2. Preliminary observations
- 3.3. Conjectures
- 4. Distribution representation and Laplace inversion
- 5. Convergence examples
- 5.1. Markovian example
- 5.2. Semi-Markov example
- 6. System-size passage-time analysis
- 6.1. A distributed web-server cluster model
- 6.2. Convergence of the iterative passage-time algorithm
- 6.3. Passage-time densities
- 7. Conclusion
- Acknowledgements
- References






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)







