Preference-Guided Register Assignment [chapter]

Matthias Braun, Christoph Mallon, Sebastian Hack
2010 Lecture Notes in Computer Science  
This paper deals with coalescing in SSA-based register allocation. Current coalescing techniques all require the interference graph to be built. This is generally considered to be too compile-time intensive for just-in-time compilation. In this paper, we present a biased coloring approach that gives results similar to standalone coalescers while significantly reducing compile time.
doi:10.1007/978-3-642-11970-5_12 fatcat:pcta374gang3xeigb4qsjqckpy