Affiliation:
1. Department of Computer Science, The Pennsylvania State University, University Park, PA
Abstract
An algorithm which schedules forests of
n
tasks on
m
identical processors in
O
(
n
log
m
) time, offline, is given. The schedules are optimal with respect to finish time and contain at most
n
- 2 preemptions, a bound which is realized for all
n
. Also given is a simpler algorithm which runs in
O
(
nm
) time on the same problem and can be adapted to give optimal finish time schedules on-line for independent tasks with release times.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference14 articles.
1. Ano A.V. HoPc~orr J.E. ~' ~D ULLMAN j D.Wesley Reading Mass. 1974. The Design and Analysis of Computer Algorithms. Addison- Ano A.V. HoPc~orr J.E. ~' ~D ULLMAN j D.Wesley Reading Mass. 1974. The Design and Analysis of Computer Algorithms. Addison-
2. Preemptive Scheduling of Uniform Processor Systems
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献