Hybrid Optimizations: Which Optimization Algorithm to Use?

2006/01/01 by John Cavazos, J. Eliot B. Moss, Michael O’Boyle +1 · 3 citations
Computer Science · #Algorithm #Allocator #Compile time #Compiler #Computer science #Formal Methods in Verification #Graph #Graph coloring #Heuristics #Logic, programming, and type systems #Parallel Computing and Optimization Techniques #Parallel computing #Programming language #Register allocation #Theoretical computer science

paper · doi:10.1007/11688839_12

crossref issued 2006/01/01 · crossref published 2006/01/01 · crossref published-print 2006/01/01 · openalex publication_date 2006/01/01 · crossref created 2006/03/28 · crossref deposited 2019/01/19 · openalex created_date 2025/10/10 · crossref indexed 2026/01/31 · openalex updated_date 2026/07/29

Citations

• Improvements to graph coloring register allocation
• Register allocation & spilling via graph coloring
• Meta optimization
• Linear scan register allocation
• Optimal spilling for CISC machines with few registers
• Register allocation & spilling via graph coloring

Cited by

• Register allocation for Intel processor graphics
• Split Register Allocation: Linear Complexity Without the Performance Penalty
• Register allocation [wikipedia]