Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system
Communications of the ACM
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Communications of the ACM
Analysis and applications of probabilistic models of multiprogrammed computer systems.
Analysis and applications of probabilistic models of multiprogrammed computer systems.
Performance monitors for multi-programming systems
SOSP '69 Proceedings of the second symposium on Operating systems principles
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
| Hi-index | 0.00 |
A popular CPU (Central Processing Unit) scheduling strategy is to give high priority to those jobs with short CPU service times. There are several algorithms for predicting which jobs among all the resident jobs have short service times. No scheme, however, has proved to be 100% accurate in identifying the short jobs. This paper, utilizing results from both simulation and mathematical models, studies the sensitivity of CPU utilization to the accuracy of the predictive algorithm.