Abstract
Several analytically solvable queueing models of multiprogramming with different jobs and various scheduling disciplines are investigated. It is shown that the analysis of these models supports the optimality of the already proposed CPU scheduling discipline which assigns higher processing priority to a more I/O bound job. Furthermore, the effects of some endogenous scheduling disciplines such as preemptive-resume last-come-first-served are compared with that of this discipline using some queueing models.
Cite
CITATION STYLE
Kameda, H. (1982). CPU scheduling for effective multiprogramming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 143 LNCS, pp. 104–118). Springer Verlag. https://doi.org/10.1007/3-540-11604-4_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
