15-745 Spring '11
Class Handouts

Lecture Notes

Lecture 1: Overview of Optimizations (Jan. 11) PDF
Lecture 2: Local Optimizations (Jan. 12) PDF
Lecture 3: The LLVM Compiler (Jan. 13) PDF
Lecture 4: Introduction to Data Flow Analysis (Jan. 18) PDF
Lecture 5: Foundations of Data Flow Analysis (Jan. 19) PDF
Lecture 6: Global Common Subexpression Elimination, Constant Folding (Jan. 20) PDF
Lecture 7: Loop Invariant Code Motion (Jan. 25) PDF
Lecture 8: Induction Variables and Strength Reduction (Jan. 26) PDF
Lecture 9: Partial Redundancy Elimination (Jan. 27) PDF
Lecture 10: Lazy Code Motion (Feb. 1) PDF
Lecture 11: Region-Based Analysis (Feb. 2) PDF
Lecture 12: Intro to Static Single Assignment (Feb. 3) PDF
Lecture 13: SSA-style Optimizations (Feb. 8) PDF
Lecture 14: Register Allocation: Coloring (Feb. 9) PDF
Lecture 15: Register Allocation: Coalescing and Spilling (Feb. 10) PDF
Lecture 16: Intro to Instruction Scheduling (Feb. 15) PDF
Lecture 17: List Scheduling (Feb. 16) PDF
Lecture 18: Global Scheduling (Feb. 17) PDF
Lecture 19: Software Pipelining (Feb. 22) PDF
Lecture 20: Memory Hierarchy Optimizations (Feb. 23) PDF
Lecture 21: Data Prefetching (Feb. 24) PDF
Lecture 25: Dynamic Code Optimization (Mar. 16) PDF
Lecture 26: Array Dependence Analysis (Mar. 22) PDF
Lecture 27: Pointer Analysis (Mar. 23) PDF
Lecture 28: Thread-Level Speculation (Mar. 24)
- Overview: PDF
- Optimization: PDF