Kritischer Vergleich von Algorithmen für ein Scheduling-Problem
In this paper we are concerned with algorithms producing schedules for processes which consist of a finite set of tasks and a precedence relation between them. For executing tasks a system of m identical processors is available. We are interested in algorithms producing non preemptive schedules which are nearly time-optimal. For some well-known algorithms the lengths of their schedules are compared with the lengths of time-minimal schedules. A new algorithm which produces considerably better schedules is presented and discussed.
Unable to display preview. Download preview PDF.
- 1.Chen, N.F. and C.L. Liu: On a class of scheduling algorithms for multiprocessing computing systems, Proceedings of the Sagamore Computer Conference on Parallel Processing 1974. Lecture Notes in Computer Science 24, 1–16 (1975).Google Scholar
- 2.Coffman, E.G., Jr., and P.J. Denning: Operating systems theory, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1973.Google Scholar
- 3.Coffman, E.G., Jr., and R.L. Graham: Optimal scheduling for two-processor systems, Acta Informatica 1, 200–213 (1972).Google Scholar
- 4.Hu, T.C.: Parallel sequencing and assembly line problems, Opns. Res. 9, 841–848 (1961).Google Scholar
- 5.Johnson, D.S,: Approximation algorithms for combinatorial problems, Proceedings of the 5th Annual Symposium on Theory of Complexity, Austin, Texas, 38–49 (1973).Google Scholar
- 6.Krone, M.: Heuristic programming applied to scheduling problems, Ph.D. thesis, Dept. of Electrical Engineering, Princeton Univ., Princeton, N.J. (1970).Google Scholar
- 7.Ullman, J.D.: NP-complete scheduling problems, Journal of Computer and System Sciences 10, 384–393 (1975).Google Scholar