Register Allocation for Programs in SSA-Form.

Bibliographic Details
Title: Register Allocation for Programs in SSA-Form.
Authors: Mycroft, Alan, Zeller, Andreas, Hack, Sebastian, Grund, Daniel, Goos, Gerhard
Source: Compiler Construction (9783540330509); 2006, p247-262, 16p
Abstract: As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation architecture for programs in SSA-form which simplifies register allocation significantly. We investigate certain properties of SSA-programs and their interference graphs, showing that they belong to the class of chordal graphs. This leads to a quadratic-time optimal coloring algorithm and allows for decoupling the tasks of coloring, spilling and coalescing completely. After presenting heuristic methods for spilling and coalescing, we compare our coalescing heuristic to an optimal method based on integer linear programming. [ABSTRACT FROM AUTHOR]
Copyright of Compiler Construction (9783540330509) is the property of Springer eBooks and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/11688839_20
Database: Supplemental Index