Register allocation for programs in ssa-form

Register allocation for programs in ssa-form (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sebastian Hack , Daniel Grund , Gerhard Goos

Venue:	In Compiler Construction 2006, volume 3923 of LNCS
Citations:	20 - 3 self

BibTeX

@INPROCEEDINGS{Hack06registerallocation,
    author = {Sebastian Hack and Daniel Grund and Gerhard Goos},
    title = {Register allocation for programs in ssa-form},
    booktitle = {In Compiler Construction 2006, volume 3923 of LNCS},
    year = {2006},
    publisher = {Springer Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this technical report, we present an architecture for register allocation on the SSA-form. We show, how the properties of SSA-form programs and their interference graphs can be exploited to develop new methods for spilling, coloring and coalescing. We present heuristic and optimal solution methods for these three subtasks. 1

Citations

991	Algorithmic graph theory and perfect graphs - Golumbic - 1980
749	Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
442	A study of replacement algorithms for a virtual-storage computer - Belady - 1966
158	Improvements to Graph Coloring Register Allocation - BRIGGS, COOPER, et al. - 1994
155	The prioritybased coloring approach to register allocation - Chow, Hennessy - 1990
132	Iterated register coalescing - George, Appel - 1996
98	Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph - Gavril - 1972
58	Optimal spilling for CISC machines with few registers - Appel, George - 2001
55	Practical improvements to the construction and destruction of static single assignment form - Briggs, Cooper, et al. - 1998
50	SSA is functional programming - Appel - 1998
34	Spill Code Minimization via Interference Region Spilling - Bergner, Dahl, et al. - 1997
34	A correspondence between continuation passing style and static single assignment form - Kelsey - 1995
34	Optimistic register coalescing - Park, Moon
27	Fast copy coalescing and live range identification - Budimlić, Cooper, et al. - 2002
25	On the minimization of loads/stores in local register allocation - Hsu, Fischer, et al. - 1989
19	F.K.: Efficiently computing static single assignment form and the control dependence graph - Cytron, Ferrante, et al. - 1991
16	Register allocation via coloring of chordal graphs - Pereira, Palsberg - 2005
15	Polynomial time graph coloring register allocation - Brisk, Dabiri, et al. - 2005
14	Precoloring extension - Tuza - 1992
12	P.W.: Register allocation via graph coloring - Chaitin, Auslander, et al. - 1981
8	D.: The power of beladys algorithm in register allocation for long basic blocks - Guo, Garzarn, et al. - 2003
8	Register allocation by optimal graph coloring - Andersson - 2003
7	Quintão Pereira and Jens Palsberg. Register allocation via coloring of chordal graphs - Magno - 2005
6	Interference graphs of programs in SSA-form - Hack - 2005
5	Allocation de registres et vidage en mémoire - Bouchez
3	Graph Coloring with Local and Global Constraints - Marx - 2004
2	R.: Firm, an intermediate language for compiler research - Lindenmaier, Beck, et al. - 2005
1	de Ferrire, and Christophe Guillon. Optimizing translation out of ssa with renaming constraints - Rastello, Francois - 2003
1	Graph Theory. 3 edn. Volume 173 of Graduate Texts in Mathematics - Diestel - 2005