## Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors using A Parallel Genetic Algorithm (1997)

### Cached

### Download Links

- [www.eee.hku.hk]
- [ranger.uta.edu]
- [ranger.uta.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING |

Citations: | 35 - 5 self |

### BibTeX

@ARTICLE{Kwok97efficientscheduling,

author = {Yu-Kwong Kwok and Ishfaq Ahmad},

title = {Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors using A Parallel Genetic Algorithm},

journal = {JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING},

year = {1997},

volume = {47},

pages = {58--77}

}

### Years of Citing Articles

### OpenURL

### Abstract

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptions, and becomes more complex under relaxed assumptions such as arbitrary precedence constraints, and arbitrary task execution and communication times. The present literature on this topic is a large repertoire of heuristics that produce good solutions in a reasonable amount of time. These heuristics, however, have restricted applicability in a practical environment because they have a number of fundamental problems including high time complexity, lack of scalability, and no performance guarantee with respect to optimal solutions. Recently, genetic algorithms (GAs) have been widely reckoned as a useful vehicle for obtaining high quality or even optimal solutions for a broad range of combinato...