Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
Journal of the ACM (JACM)
AMVA techniques for high service time variability
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
MAMSolver: A Matrix Analytic Methods Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
An EM-based technique for approximating long-tailed data sets with PH distributions
Performance Evaluation - Internet performance symposium (IPS 2002)
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Structured Markov chains solver: software tools
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Performance impacts of autocorrelated flows in multi-tiered systems
Performance Evaluation
Bound analysis of closed queueing networks with workload burstiness
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A note on stable flow-equivalent aggregation in closed networks
Queueing Systems: Theory and Applications
User-friendly approach to capacity planning studies with Java modelling tools
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Collaborative reliability prediction of service-oriented systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Fluid Analysis of Queueing in Two-Stage Random Environments
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Explicit inverse characterizations of acyclic MAPs of second order
EPEW'06 Proceedings of the Third European conference on Formal Methods and Stochastic Models for Performance Evaluation
Dealing with Burstiness in Multi-Tier Applications: Models and Their Parameterization
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Run-time resource allocation requires the availability of system performance models that are both accurate and inexpensive to solve. We here propose a new methodology for run-time performance evaluation based on a class of closed queueing networks. Compared to exponential product-form models, the proposed queueing networks also support the inclusion of resources having first-come first-served scheduling under non-exponential service times. Motivated by the lack of an exact solution for these networks, we propose a fixed-point algorithm that approximates performance indexes in linear time and linear space with respect to the number of requests considered in the model. Numerical evaluation shows that, compared to simulation, the proposed models solved by fixed-point iteration have errors of about 1%-6%, while, on the same test cases, exponential product-form models suffer errors even in excess of 100%. Execution times on commodity hardware are of the order of a few seconds or less, making the proposed methodology practical for run-time decision-making.