15-411 Compiler Design
Lecture 3: Register Allocation

• Reading: 03-regalloc.pdf, Ch 11
• Concepts:
  • Register allocation via graph coloring
  • Chordal graphs
  • Simplicial elimination ordering
  • Maximum cardinality search
  • Greedy coloring
  • Register spilling
  • Register coalescing
  • Precolored nodes
• Previous lecture: Instruction Selection
• Next lecture: Liveness Analysis

[ Home | Schedule | Labs & Assignments | Exams | Lab Machines | Resources ]
[ Textbook | Autolab ]
[ Blackboard | academic.cs.15-411 ]

fp@cs
Frank Pfenning