Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
| Hi-index | 0.00 |
Many algorithms for scheduling DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multiprocessor scheduling is an NP-hard problem, no exact tractable algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been found for only a few simple DAGs. This paper is an attempt to quantify the differences in a few of the heuristics. New classification criteria are defined for the DAGs, and the differences between the heuristics are noted for various criteria. The comparison is made between a graph based method, and two critical path methods. The empirical performance of the three heuristics is compared when they are applied to the randomly generated DAGs.