Optimal spilling for CISC machines with few registers

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2001, Pages 243-253

  Appel, A W ^a   George, L ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

GRAPH COLORING REGISTERS;

COLOR COMPUTER GRAPHICS;

EID: 0034819721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Standard ML of New Jersey
2. Improvements to graph coloring register allocation
3. Register allocation via coloring
4. The priority-based coloring approach to register allocation
5. Iterated register coalescing
6. A portable and optimizing back end for the SML/NJ compiler
7. Optimal and near-optimal global register allocation using 0-1 integer programming
8. On the geographical problem of the four colors
9. Precise register allocation for irregular architectures
10. Global register allocation based on graph fusion
11. Optimistic register coalescing
12. Static branch frequency and program profile analysis