Register Allocation Via Coloring of Chordal Graphs

13 years 10 months ago

Download www.cs.ucla.edu

We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95% of the

Fernando Magno Quintão Pereira, Jens Palsbe

Real-time Traffic

APLAS 2005 | Register Coalescing Algorithm | Simple Algorithm |

claim paper

» Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Grap...

» Register Allocation for Programs in SSAForm

» Register Allocation After Classical SSA Elimination is NPComplete

» Revisiting Graph Coloring Register Allocation A Study of the ChaitinBriggs and CallahanKob...

» Optimal polynomialtime interprocedural register allocation for highlevel synthesis and ASI...

» On the Complexity of Register Coalescing

» Formal Verification of Coalescing GraphColoring Register Allocation

» Predictable Paging in RealTime Systems A Compiler Approach

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	APLAS
Authors	Fernando Magno Quintão Pereira, Jens Palsberg

Comments (0)

Sciweavers

Register Allocation Via Coloring of Chordal Graphs

APLAS 2005 | Register Coalescing Algorithm | Simple Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers