论文信息 - A New Algorithm for Preemptive Scheduling of Trees

A New Algorithm for Preemptive Scheduling of Trees

An algorithm which schedules forests of <italic>n</italic> tasks on <italic>m</italic> identical processors in <italic>O</italic>(<italic>n</italic> log <italic>m</italic>) time, offline, is given. The schedules are optimal with respect to finish time and contain at most <italic>n</italic> - 2 preemptions, a bound which is realized for all <italic>n</italic>. Also given is a simpler algorithm which runs in <italic>O</italic>(<italic>nm</italic>) time on the same problem and can be adapted to give optimal finish time schedules on-line for independent tasks with release times.

Teofilo F. Gonzalez | Donald B. Johnson | T. Gonzalez | Donald B. Johnson

[1] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

[2] Shui Lam,et al. Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..

[3] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[4] Edward G. Coffman,et al. Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[5] Shui Lam,et al. A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

[6] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[7] Jane W.-S. Liu,et al. Optimal scheduling of independent tasks on heterogeneous computing systems , 1974, ACM '74.

[8] W. A. Horn. Some simple scheduling algorithms , 1974 .

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

[10] Sartaj Sahni,et al. Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[11] D. Teichroew,et al. Optimal Short Term Financing Decision , 1965 .

[12] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[13] Edward G. Coffman,et al. Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.