On a class of scheduling algorithms for multiprocessors computing systems
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.
KeywordsSchedule Algorithm Optimal Schedule Total Execution Time Priority List Idle Period
Unable to display preview. Download preview PDF.
- E.G. Coffman, Jr., and R.L. Graham, "Optimal scheduling for two-processor systems," Acta Informatia 2 1972, pp. 200–213.Google Scholar
- J. Edmonds, "Paths, trees and flowers," Can. Jour. of Math 17 1965, pp. 449–467.Google Scholar
- M. Fujii, T. Kasami, and K. Ninomiya, "Optimal sequencing of two equivalent processors," SIAM Jour. of App. Math 17 No. 3 1969, pp. 784–789.Google Scholar
- R.L. Graham, "Bounds on multiprocessing timing anomalies," SIAM Jour. of App. Math 17 No. 2 1969, pp. 416–429.Google Scholar
- T.C. Hu, "Parallel sequencing and assembly line problems," Oper. Res. 9 No. 6 1961, pp. 841–848.Google Scholar