15-411 Compiler Design
Lecture 13: Chordal Interference Graphs

Reading: Fernando Magno Quintão Pereira and Jens Palsberg
Register Allocation Via Coloring of Chordal Graphs
Proceedings of the 3rd Asian Symposium on Programming Languages and Systems (APLAS'05)
Tsukuba, Japan, pp 315-329, Springre LNCS 3780, November 2005
Video: 15411f07 - Lecture 13
Concepts:
- Chordal graphs
- Simplicial elimination order
- Maximum cardinality search
- Greedy coloring
- Pre- or post-spilling
- Coalescing
Previous lecture: Operational Semantics
Next lecture: