Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems

Abstract

In multiprogramming computer systems, the scheduling strategy used to select tasks to be activated is an important factor in the achievement of the performance goals of the system. One form of analysm of scheduling algorithms represents the system as an abstract model of computation and then formally analyzes the algorithms operating in the context of the model. This paper presents an abstract system model which consists of several identical and independent task processors and a memory of arbitrary size Tasks are represented by processing-time and memory requirements which must be met by the model. Worst-case performance bounds are derived for sever al simple scheduling algortthms. A new heuristic algorithm, which uses a look-ahead strategy, is introduced This algorithm is shown to be better in many cases than the simpler algorithms when the worst-case performance bounds are compared. © 1975, ACM. All rights reserved.