Sensitivity of predictive scheduling

Abstract

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.