Probability Models for Multiprogramming Computer Systems
Journal of the ACM (JACM)
Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system
Communications of the ACM
An analysis of central processor scheduling in multiprogrammed computer systems (digest edition).
An analysis of central processor scheduling in multiprogrammed computer systems (digest edition).
Surveyors' forum—high-performance secondary memory
ACM Computing Surveys (CSUR)
Optimality of scheduling policy for processing a job stream
ACM Transactions on Computer Systems (TOCS)
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Probabilistic performance modeling of virtualized resource allocation
Proceedings of the 7th international conference on Autonomic computing
| Hi-index | 0.00 |
Upper and lower bounds on processor utilization for the queueing model M/G/1/N are derived. The upper bound is equal to the utilization for constant service times and the lower bound is approached when the average number of operations per busy period approaches one. These bounds show that the form of the processing time distribution can have a substantial effect on processor utilization. We show that the utilization will be near the lower bound if there are a large number of short processing times. The variance does not always give an accurate indication of the effect of the distribution on utilization.