Optimality of a Central Processor Scheduling Strategy in Multiprogrammed Computer Systems

Hisao KAMEDA  

IEICE TRANSACTIONS (1976-1990)   Vol.E64   No.3   pp.120-125
Publication Date: 1981/03/25
Online ISSN: 
Print ISSN: 0000-0000
Type of Manuscript: PAPER
Category: Computers

Full Text: PDF>>
Buy this Article

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 the higher processing priority to the more I/O bound jobs. 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.