On a class of scheduling algorithms for multiprocessors computing systems

Abstract

In this paper we study a class of scheduling algorithms for multiprocessors computing systems which we call level algorithms. These algorithms are simple and easy to implement. They produce optimal schedules in some cases, and produce close-to-optimal schedules in other cases. Sufficient conditions under which schedules produced by the level algorithms will be optimal are obtained. For the sub-optimal schedules, we are able to compare quantitatively their performance against that of an optimal schedule.