Title
Register allocation deconstructed
Abstract
Register allocation is a fundamental part of any optimizing compiler. Effectively managing the limited register resources of the constrained architectures commonly found in embedded systems is essential in order to maximize code quality. In this paper we deconstruct the register allocation problem into distinct components: coalescing, spilling, move insertion, and assignment. Using an optimal register allocation framework, we empirically evaluate the importance of each of the components, the impact of component integration, and the effectiveness of existing heuristics. We evaluate code quality both in terms of code performance and code size and consider four distinct instruction set architectures: ARM, Thumb, x86, and x86-64. The results of our investigation reveal general principles for register allocation design.
Year
Venue
Keywords
2009
software and compilers for embedded systems
register allocation problem,register allocation,register allocation design,distinct component,optimal register allocation framework,distinct instruction set architecture,code quality,limited register resource,code size,code performance,instruction set architecture,optimizing compiler,embedded system
Field
DocType
Citations 
x86,Computer architecture,Register allocation,Code size,Computer science,Instruction set,Parallel computing,Real-time computing,Optimizing compiler,Heuristics,Processor register,Software quality
Conference
3
PageRank 
References 
Authors
0.37
16
2
Name
Order
Citations
PageRank
David Ryan Koes11209.10
Seth Copen Goldstein21951232.71