Split Register Allocation: Linear Complexity Without the Performance Penalty

2010/01/01 by Boubacar Diouf, Albert Cohen, Fabrice Rastello +1 · 1 citation
Computer Science · #Algorithm #Allocator #Bytecode #Compiler #Computer science #Formal Methods in Verification #Java #Linear programming #Logic, programming, and type systems #Parallel Computing and Optimization Techniques #Parallel computing #Programming language #Register allocation #Software portability #Time complexity

paper · doi:10.1007/978-3-642-11515-8_7

crossref issued 2010/01/01 · crossref published 2010/01/01 · crossref published-print 2010/01/01 · openalex publication_date 2010/01/01 · crossref created 2010/01/20 · crossref deposited 2020/11/24 · crossref indexed 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Citations

• Hybrid Optimizations: Which Optimization Algorithm to Use?
• Register allocation via coloring
• Improvements to graph coloring register allocation
• Optimized interval splitting in a linear scan register allocator
• The DaCapo benchmarks
• Optimal spilling for CISC machines with few registers
• Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How

Cited by

• Register allocation [wikipedia]