Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
RECAL—a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks
Journal of the ACM (JACM)
Calculating joint queue-length distributions in product-form queuing networks
Journal of the ACM (JACM)
Mean Value Analysis by Chain of Product form Queueing Networks
IEEE Transactions on Computers
A perspective on queueing models of computer performance
Performance Evaluation
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants
Journal of the ACM (JACM)
The MVA priority approximation
ACM Transactions on Computer Systems (TOCS)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Balanced job bound analysis of queueing networks
Communications of the ACM
Computational algorithms for product form queueing networks
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Analysis of Queueing Networks with Blocking
Analysis of Queueing Networks with Blocking
On the asymptotic behaviour of closed multiclass queueing networks
Performance Evaluation
A Unifying Framework for the Approximate Solution of Closed Multiclass Queuing Networks
IEEE Transactions on Computers
Integrated Performance Models for SPMD Applications and MIMD Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Software Engineering
Exact solution of linear equations
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
A New Recursive Algorithm for Computing Generating Functions in Closed Multi-Class Queueing Networks
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Exploiting nonstationarity for performance prediction
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
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
CoMoM: class-oriented evaluation of multiclass models
ACM SIGMETRICS Performance Evaluation Review
Rethinking the Use of Models in Software Architecture
QoSA '08 Proceedings of the 4th International Conference on Quality of Software-Architectures: Models and Architectures
An application of exact linear algebra to capacity planning models
ACM Communications in Computer Algebra
Queuing model based on scheduling strategies affect local network services
CIS'09 Proceedings of the international conference on Computational and information science 2009
A generalized method of moments for closed queueing networks
Performance Evaluation
Exact analysis of performance models by the Method of Moments
Performance Evaluation
Queuing network of scale free topology: on modelling large scale network
The Journal of Supercomputing
Efficient parallelization of the Method of Moments for queueing networks using multi-modular algebra
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 0.00 |
We introduce an efficient algorithm for the exact analysis of closed multiclass product-form queueing network models with large population sizes. We adopt a novel approach, based on linear systems of equations, which significantly reduces the cost of computing normalizing constants. With the proposed algorithm, the analysis of a model with N circulating jobs of multiple classes requires essentially the solution of N linear systems with order independent of population sizes.A distinguishing feature of our approach is that we can immediately apply theorems, solution techniques, and decompositions for linear systems to queueing network analysis. Following this idea, we propose a block triangular form of the linear system that further reduces the requirements, in terms of both time and storage, of an exact analysis. An example illustrates the efficiency of the resulting algorithm in presence of large populations.