Global Register Allocation Based on Graph Fusion

DMCA

Global Register Allocation Based on Graph Fusion (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Guei-yuan Lueh , Thomas Gross , Ali-reza Adl-tabatabai

Venue:	in Languages and Compilers for Parallel Computing
Citations:	14 - 3 self

BibTeX

@TECHREPORT{Lueh96globalregister,
    author = {Guei-yuan Lueh and Thomas Gross and Ali-reza Adl-tabatabai},
    title = {Global Register Allocation Based on Graph Fusion},
    institution = {in Languages and Compilers for Parallel Computing},
    year = {1996}
}

OpenURL

Abstract

A register allocator must effectively deal with three issues: live range splitting, live range spilling, and register assignment. This paper presents a new coloring-based global register allocation algorithm that addresses all three issues in an integrated way: the algorithm starts with an interference graph for each region of the program, where a region can be a basic block, a loop nest, a superblock, a trace, or another combination of basic blocks. Region formation is orthogonal to register allocation in this framework. Then the interference graphs for adjacent regions are fused to build up the complete interference graph. The algorithm delays decisions on splitting, spilling, and register assignment, and therefore, the register allocation may be better than what is obtained by a Chatin-style allocator. This algorithm uses execution probabilities, derived from either profiles or static estimates, to guide fusing interference graphs, allowing an easy integration of this register alloc...

Keyphrases

interference graph global register allocation graph fusion basic block register assignment register allocation loop nest adjacent region complete interference graph static estimate easy integration execution probability live range spilling live range splitting chatin-style allocator register allocator region formation new coloring-based global register allocation integrated way register alloc

DMCA