Preference-Guided Register Assignment

Abstract. 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.

• Type: Conference
• Year: 2010
• Where: CC
• Authors: Matthias Braun, Christoph Mallon, Sebastian Hack
• Keywords: Biased Coloring Approach, CC 2010, Current Coalescing Techniques, Programming Languages, SSA-based Register Allocation