论文信息 - Scheduling Unit-Time Tasks with Limited Resources

Scheduling Unit-Time Tasks with Limited Resources

A set of tasks are to be scheduled on a multiprocessing system with s resources. Each task takes one unit time to complete, and requires certain amounts of resources. The schedule is to be consistent with a prescribed partial order relation on the task, and the total demand for each resource must not exceed a fixed amount at any instant. In this paper we analyze the worst-case behavior of several heuristic scheduling algorithms.

Andrew Chi-Chih Yao | A. Yao

[1] Jeffrey D. Ullman,et al. Polynomial complete scheduling problems , 1973, SOSP '73.

[2] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).

[3] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.

[4] M. Fujii,et al. Optimal Sequencing of Two Equivalent Processors , 1969 .

[5] C. L. Liu,et al. On a Class of Scheduling Algorithms for Multiprocessors Computing Systems , 1974, Sagamore Computer Conference.

[6] Ronald L. Graham,et al. Bounds on scheduling with limited resources , 1973, SOSP '73.

[7] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .