A generalized algorithm for graph-coloring register allocation
- 9 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04
- Vol. 39 (6), 277-288
- https://doi.org/10.1145/996841.996875
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Register allocation for irregular architecturesPublished by Association for Computing Machinery (ACM) ,2002
- Preference-directed graph coloringPublished by Association for Computing Machinery (ACM) ,2002
- Optimal spilling for CISC machines with few registersPublished by Association for Computing Machinery (ACM) ,2001
- Iterated register coalescingACM Transactions on Programming Languages and Systems, 1996
- Improvements to graph coloring register allocationACM Transactions on Programming Languages and Systems, 1994
- Coloring register pairsACM Letters on Programming Languages and Systems, 1992
- Graph coloring register allocation for processors with multi-register operandsPublished by Association for Computing Machinery (ACM) ,1990
- Register allocation & spilling via graph coloringPublished by Association for Computing Machinery (ACM) ,1982
- Register allocation via coloringComputer Languages, 1981