Shui Lam
Abstract
Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors. A variation of their algorithm is adapted for processors of different speeds. The algorithm is shown to be optimal on two processors for arbitrary task systems, but not on three or more processors even for trees. Taking the algorithm as a heuristic on m processors and using the ratio of the lengths of the constructed and optimal schedules as a measure, we show that, on identical processors, its performance is bounded by 2 - 2/m. Moreover 2 - 2/m is a best bound in that there exist task systems for which this ratio is approached arbitrarily closely. On processors of different speeds, we derive an upper bound of its performance in terms of the speeds of the given processor system and show that @@@@1.5m is an upper bound over all processor systems. We also give an example of a system for which the bound @@@@m/2 @@@@2 can be approached asymptotically, thus establishing that the @@@@1.5m bound can at most be improved by a constant factor.
- 1 E. G. Coffman, Jr. and R. L. Graham, "Optimal scheduling for two-processor systems," Acta Informatica 1 (1972) 200-213.Google Scholar
Digital Library
- 2 Michael R. Garey, David S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, Eighth Annual Princeton Conference on Information Sciences and Systems (Mar 74).Google Scholar
- 3 Teofilo Gonzales, Oscar Ibarra and Sartaj Sahni, Bounds for LPT schedules on uniform processors, Tech. Rep. Univ. of Minnesota.Google Scholar
- 4 Edward C. Horvath and Ravi Sethi, Preemptive schedules for independent tasks, Tech. Rep. 162, Computer Science Dept., Penn State University (Feb 1975).Google Scholar
- 5 J. W. S. Liu, C. L. Liu, Bounds on scheduling algorithms for heterogeneous computer systems, IFIP 74.Google Scholar
- 6 J. W. S. Liu, C. L. Liu, Performance analysis of heterogeneous multi-processor computing systems in E. Gelenbe and R. Mahl (ed) Computer Architectures and Networks, North Holland Publishing Co. (1974) 27-45.Google Scholar
- 7 J. W. S. Liu and A. Yang, Optimal scheduling of independent tasks on heterogeneous computing systems, 1974 ACM National Conference,38-45. Google ScholarDigital Library
- 8 R. R. Muntz, E. G. Coffman, Jr., Preemptive scheduling of real time tasks on multiprocessor systems, JACM 17, 2 (Apr 70) 324-338. Google ScholarDigital Library
- 9 R. R. Muntz, E. G. Coffman, Jr., Optimal preemptive scheduling on two-processor systems, IEEE Trans. Comp. C-18, 11 (Nov 69) 1014-1020. Google ScholarDigital Library
- 10 Ravi Sethi, Algorithms for minimal length schedules in E. G. Coffman, Jr. (ed) Computer and Job-Shop Scheduling Theory, John Wiley.Google Scholar
- 11 J. D. Ullman, Polynomial complete scheduling problems, 4th Symposium on Operating Systems Principles, Yorktown Heights, N.Y. (Oct 73) 96-101, to appear JCSS. Google ScholarDigital Library
- 12 J. D. Ullman, Complexity of sequencing problems in E. G. Coffman, Jr. (ed) Computer and Job-Shop Scheduling Theory, John Wiley.Google Scholar
Index Terms
- Analysis of a level algorithm for preemptive scheduling
Recommendations
A Level Algorithm for Preemptive Scheduling
Muntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors available. Their algorithm is adapted here to handle processors of ...
Analysis of a level algorithm for preemptive scheduling
SOSP '75: Proceedings of the fifth ACM symposium on Operating systems principlesMuntz and Coffman give a level algorithm that constructs optimal preemptive schedules on identical processors when the task system is a tree or when there are only two processors. A variation of their algorithm is adapted for processors of different ...
Scheduling Tasks with AND/OR Precedence Constraints
In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. ...
Comments