Lecture 9: Instruction Scheduling
Examples of pipeline constraints
Other aspects of pipelines
An Example
Interlocks or no interlocks
Aspects of scheduling
Dependency between instructions
Computing dependencies
Representing dependencies
Another example
List Scheduling
Intuition of the algorithm
“Enough time has elapsed”
Example
Picking between alternatives
Pick node with longest path to a leaf in the dependence DAG
Other issues
Register allocation and instruction scheduling
Ways to organize scheduling and register allocation
Summary
Next Lecture: Memory optimizations
Email: diwan@cs.stanford.edu
Home Page: http://suif.stanford.edu/~diwan/243
Download presentation source