Retargetable Graph-Coloring Register Allocation for Irregular Architectures
2003 (English)In: Software and Compilers for Embedded Systems: 7th International Workshop, SCOPES 2003, Vienna, Austria, September 24-26, 2003, Proceedings, 2003, 403- p.Conference paper (Refereed)
Global register allocation is one of the most important optimizations in a compiler. Since the early 80s, register allocation by graph coloring has been the dominant approach. The traditional formulation of graph-coloring register allocation implicitly assumes a single bank of non-overlapping general-purpose registers and does not handle irregular architectural features like overlapping register pairs, special purpose registers, and multiple register banks. We present a generalization of graph-coloring register allocation that can handle all such irregularities. The algorithm is parameterized on a formal target description, allowing fully automatic retargeting. We report on experiments conducted with a prototype implementation in a framework based on a commercial compiler.
Place, publisher, year, edition, pages
2003. 403- p.
IdentifiersURN: urn:nbn:se:uu:diva-20469ISBN: 978-3-540-20145-8OAI: oai:DiVA.org:uu-20469DiVA: diva2:48242