Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Maximum Processing Rates of Memory Bound Systems
Journal of the ACM (JACM)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
Memory management and response time
Communications of the ACM
Some Extensions to Multiclass Queueing Network Analysis
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
Computer system models with passive resources.
Computer system models with passive resources.
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
An overview of performance prediction in MVS systems and SNA networks
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Workload representations in queueing models of computer systems
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Incorporating load dependent servers in approximate mean value analysis
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Efficient approximation for models of multiprogramming with shared domains
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of Queueing Network Models with population size constraints and delayed blocked customers
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Speeding up computer system simulations using hierarchical modeling
ACM SIGMETRICS Performance Evaluation Review
Solving Semi-Open Queuing Networks
Operations Research
Modelling contention sensing memory management systems: A VAX/VMS case study
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Most computer systems have a memory constraint: a limit on the number of requests that can actively compete for processing resources, imposed by finite memory resources. This characteristic violates the conditions required for queueing network performance models to be separable, i.e., amenable to efficient analysis by standard algorithms. Useful algorithms for analyzing models of memory constrained systems have been devised only for models with a single customer class. In this paper we consider the multiple class case. We introduce and evaluate an algorithm for analyzing multiple class queueing networks in which the classes have independent memory constraints. We extend this algorithm to situations in which several classes share a memory constraint. We sketch a generalization to situations in which a subsystem within an overall system model has a population constraint. Our algorithm is compatible with the extremely time- and space-efficient iterative approximate solution techniques for separable queueing networks. This level of efficiency is mandatory for modelling large systems.