Static Task Scheduling

  • Constantine D. Polychronopoulos
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 59)


Depending on the granularity of the different parts of a program we have low and high level spreading for fine and coarse grain program modules respectively. Most instances of the spreading problem are NP-Complete [GaJo79]. In this chapter we discuss optimal solutions for some instances of high level spreading, and efficient heuristics for the intractable cases.


Execution Time Critical Path Parallel Programming Task Graph Total Execution Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Constantine D. Polychronopoulos
    • 1
    • 2
  1. 1.Center for Supercomputing Research and DevelopmentUniversity of Illinois at Urbana-ChampaignUSA
  2. 2.Department of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignUSA

Personalised recommendations