Static scheduling algorithms for allocating directed task graphs to multiprocessors

  • Authors:

  • Yu-Kwong Kwok;Ishfaq Ahmad

  • Affiliations:

  • Univ. of Hong Kong, Hong Kong;Hong Kong Univ. of Science and Technology, Hong Kong

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Static scheduling of a program represented by a directed task graph on a multiprocessor system to minimize the program completion time is a well-known problem in parallel processing. Since finding an optimal schedule is an NP-complete problem in general, researchers have resorted to devising efficient heuristics. A plethora of heuristics have been proposed based on a wide spectrum of techniques, including branch-and-bound, integer-programming, searching, graph-theory, randomization, genetic algorithms, and evolutionary methods. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. Since these algorithms are based on diverse assumptions, they differ in their functionalities, and hence are difficult to describe in a unified context. We propose a taxonomy that classifies these algorithms into different categories. We consider 27 scheduling algorithms, with each algorithm explained through an easy-to-understand description followed by an illustrative example to demonstrate its operation. We also outline some of the novel and promising optimization approaches and current research trends in the area. Finally, we give an overview of the software tools that provide scheduling/mapping functionalities.