Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint
Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Analysis of system bottlenecks using a queueing network model
Proceedings of the SIGOPS workshop on System performance evaluation
The optimal organization of multiprogrammed multi-level memory
Proceedings of the SIGOPS workshop on System performance evaluation
Network models for large-scale time-sharing systems
Network models for large-scale time-sharing systems
Mathematical models of multiprogrammed computer systems
Mathematical models of multiprogrammed computer systems
Scheduling in systems with two scarce resources
ACM '74 Proceedings of the 1974 annual conference - Volume 1
| Hi-index | 0.00 |
The formulation of the closed queuing network model of a multiprogramming computer system is generalized to allow each task to have its own set of facility service rates and I/O device selection probability distribution. In the model, processor sharing is assumed for different types of customers. It is shown through a series of investigations that the model reasonably approximates preemptive priority dispatching.