Compilation Methods SS 2009 - Slide 504
Objectives:
A simple fundamental scheduling algorithm
In the lecture:
- Explain ASAP and ALAP.
- Explain restrictions on the selection of operations.
- Show how the register need is modeled.
Suggested reading:
Kastens / Übersetzerbau, Section 8.5.1
Assignments:
- The algorithm allocates an operation as soon as possible (ASAP). Describe a variant of the algorithm which allocates an operation as late as possible (ALAP).
- Describe a variant, that allocates operations of different execution times.
Questions:
- Compare the way register need is modeled with the approach of Belady for register allocation.
- Why need tight schedules more registers?
©2009 Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 30.03.2009