A Comparison of Multiprocessor Scheduling Heuristics


Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their eeectiveness. Since multi-processor scheduling is an NP-hard problem, no exact tractible algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been… (More)
DOI: 10.1109/ICPP.1994.19


11 Figures and Tables


Citations per Year

135 Citations

Semantic Scholar estimates that this publication has 135 citations based on the available data.

See our FAQ for additional information.