Efficient Scheduling of Tasks Without Full Use of Processor Resources
Name
MIT-LCS-TM-122.pdf
Size
10.94 MB
Format
Adobe PDF
Checksum (MD5)
d02e370cbf11ea0d8aa464cdfbe1da96
Author(s)
Jaffe, Jeffrey
Date Issued
January 1979
Series/Report no.
MIT-LCS-TM-122
Abstract
The nonpreemptive scheduling of a partially ordered set of tasks on a machine with m processors of different speeds is studied. Heuristics are presented which benefit from selective non-use of slow processors. The performance of these heuristics is aymptotic of √m times worse than optimal, whereas demand driven schedules are unboundedly worse than optimal for any fixed value of m. The algorithms are extended to the situation where functionally dediciated processors must process tasks of a given type. Here, too, the worse case performance of the algorithms improves on the worst case performance of known algorithms. The techniques of analyzing these schedules are used to obtain a bound on a large class of preemptive schedules.
Persistent DSpace Link
