Algorithms for Scheduling Tasks on Unrelated Processors
Name
MIT-LCS-TM-137.pdf
Size
5.03 MB
Format
Adobe PDF
Checksum (MD5)
3a4a91b3f5f2799061bcdab7bf5981c7
Author(s)
Davis, Ernest
Jaffe, Jeffrey M.
Date Issued
June 1979
Series/Report no.
MIT-LCS-TM-137
Abstract
Several algorithms are presented for the nonpreemptive assignment of n independent tasks to m unrelated processors. One algorithm requires polynomial time in n and m, and is at most 2√m times worse than optimal in the worst case. This is the best polynomial time algorithm known for scheduling such sets of tasks. An algorithm with slightly better worst case performance requires polynomial time in n but exponential time in m. This is the best algorithm known that requires time O(nlog(n)) for every fixed value of m.
Persistent DSpace Link
