A New Algorithm for Preemptive Scheduling of Trees

Authors:
Teofilo F. Gonzalez;Donald B. Johnson
Affiliations:
Department of Computer Science, The Pennsylvania State University, University Park, PA;Department of Computer Science, The Pennsylvania State University, University Park, PA
Venue:
Journal of the ACM (JACM)
Year:
1980

Citing 5
Cited 3

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Journal of the ACM (JACM)
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Optimal scheduling of independent tasks on heterogeneous computing systems

ACM '74 Proceedings of the 1974 annual conference - Volume 1

Scheduling parallel jobs to minimize the makespan

Journal of Scheduling
Optimal preemptive scheduling on a fixed number of identical parallel machines

Operations Research Letters
Reactive scheduling in a job shop where jobs arrive over time

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.