Compilation Methods SS 2009 - Slide 503
Objectives:
A simple fundamental scheduling algorithm
In the lecture:
- Explain the algorithm using the example.
- Show variants of orders in the ready list, and their consequences.
- Explain the heuristic.
Suggested reading:
Kastens / Übersetzerbau, Section 8.5.1
Assignments:
- Write the parallel code for this example.
Questions:
- Explain the heuristic with respect to critical paths.
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009