Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
The aggregate server method for analyzing serialization delays in computer systems
ACM Transactions on Computer Systems (TOCS)
Analyzing queueing networks with simultaneous resource possession
Communications of the ACM
A model of shared DASD and multipathing
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
Network models for large-scale time-sharing systems
Network models for large-scale time-sharing systems
Metamodeling: a study of approximations in queueing models
Metamodeling: a study of approximations in queueing models
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
An important problem in queueing network modeling is that of characterizing and analyzing relationships among alternative models of a single system. The problem is approached by developing the concept of a state space transformation, which is a mechanism for expressing the way one model can be mapped into another. After discussing state space transformations in general terms, some important transformations are presented. The usefulness of the technique is demonstrated by developing state space transformations for the shadow CPU technique for analyzing preemptive priority scheduling and the aggregate server method for modeling serialization delays.