Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
Passage time distributions in large Markov chains
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Response time densities in generalised stochastic petri net models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Efficient approximation of response time densities and quantiles in stochastic models
WOSP '04 Proceedings of the 4th international workshop on Software and performance
Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation
International Journal of Applied Mathematics and Computer Science
Extracting state-based performance metrics using asynchronous iterative techniques
Performance Evaluation
Passage-time computation and aggregation strategies for large semi-Markov processes
Performance Evaluation
Hi-index | 0.00 |
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.