Static Task Scheduling
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.
KeywordsExecution Time Critical Path Parallel Programming Task Graph Total Execution Time
Unable to display preview. Download preview PDF.