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)
Memory management and response time
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Model of a Time-Sharing System with two Classes of Processes
GI - 5. Jahrestagung
Multiple class memory constrained queueing networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast approximate solution of multiprogramming models
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The mathematics of product form queuing networks
ACM Computing Surveys (CSUR)
Multiclass queueing networks with population constrainted subnetworks
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Speeding up computer system simulations using hierarchical modeling
ACM SIGMETRICS Performance Evaluation Review
SLA-driven planning and optimization of enterprise applications
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Hi-index | 0.01 |
Queueing network models of multiprogramming systems with memory constraints and multiple classes of jobs are important in representing large commercial computer systems. Typically, an exact analytical solution of such models is unavailable, and, given the size of their state space, the solution of models of this type is approached through simulation and/or approximation techniques. Recently, a computationally efficient iterative technique has been proposed by Brandwajn, Lazowska and Zahorjan for models of systems in which each job is subject to a separate memory constraint, i.e., has its own memory domain. In some important applications, it is not unusual, however, to have several jobs of different classes share a single memory “domain” (e.g., IBM's Information Management System). We present a simple approximate solution to the shared domain problem. The approach is inspired by the recently proposed technique which is complemented by a few approximations to preserve the conceptual simplicity and computational efficiency of this technique. The accuracy of the results is generally in fair agreement with simulation.