## A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors (1991)

Citations: | 26 - 3 self |

### BibTeX

@INPROCEEDINGS{Yang91afast,

author = {Tao Yang and Apostolos Gerasoulis},

title = {A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors},

booktitle = {},

year = {1991},

pages = {633--642}

}

### Years of Citing Articles

### OpenURL

### Abstract

Scheduling parallel tasks on an unbounded number of completely connected processors when communication overhead is taken into account is NP-complete. Assuming that task duplication is not allowed, we propose a fast heuristic algorithm, called the dominant sequence clustering algorithm (DSC), for this scheduling problem. The DSC algorithm is superior to several other algorithms from the literature in terms of both computational complexity and parallel time. We present experimental results for scheduling general directed acyclic task graphs (DAGs) and compare the performance of several algorithms. Moreover, we show that DSC is optimum for special classes of DAGs such as join, fork and coarse grain tree graphs. 1 Introduction Scheduling parallel tasks with precedence relations over distributed memory multiprocessors has been found to be much more difficult than the classical scheduling problem, see Graham [14] and Lenstra and Kan [15]. This is because data transferring between processor...