This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scheduling Heuristics in a Multiprogramming Environment
July 1978 (vol. 27 no. 7)
pp. 628-637
W.F. Appelbe, Department of Computer Science, Southern Methodist University
Utilization of a uniprocessor system in a multiprogramming environment can be optimized by maximizing the overlap of processor and input-output operations. A computational process can be modeled by a directed graph each node of which represents a task comprising processor and input-output segments. Any optimal schedulng algorithm for the model cannot be polynomially bounded, but the optimal criteria can be used to develop a hierarchy of dispatching heuristics based upon selecting an optimal partial task schedule. These heuristics are analyzed and evaluated by a simulation study and are shown to be more effective than those previously proposed. The dispatching heuristics developed have a wide range of potential applications to systems requiring dynamic task scheduling.
Index Terms:
sequence dominance, Multiprogramming, partial sequence, scheduling heuristics, task, task segment
Citation:
W.F. Appelbe, M.R. Ito, "Scheduling Heuristics in a Multiprogramming Environment," IEEE Transactions on Computers, vol. 27, no. 7, pp. 628-637, July 1978, doi:10.1109/TC.1978.1675163
Usage of this product signifies your acceptance of the Terms of Use.