A methodology for the real world

@article{Chaitin1981AMF,
  title={A methodology for the real world},
  author={G. Chaitin and M. Auslander and A. K. Chandra and J. Cocke and M. Hopkins and Peter W. Markstein},
  journal={Computer Languages},
  year={1981},
  volume={6},
  pages={47-57}
}
Register allocation may be viewed as a graph coloring problem. Each node in the graph stands for a computed quantity that resides in a machine register, and two nodes are connected by an edge if the quantities interfere with each other, that is, if they are simultaneously live at some point in the object program. This approach, though mentioned in the literature, was never implemented before. Preliminary results of an experimental implementation in a PL/I optimizing compiler suggest that global… Expand
594 Citations
All Structured Programs have Small Tree-Width and Good Register Allocation
  • M. Thorup
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1998
  • 172
The Priority-Based Register Allocation
  • 5
Efficient global register allocation
  • PDF
Register Allocation with Graph Coloring by Ant Colony Optimization
  • 5
  • PDF
Register allocation & spilling via graph coloring
  • 567
  • PDF
A Randomized Heuristic Approach to Register Allocation
  • 8
  • PDF
Optimal Register Allocation in Polynomial Time
  • 20
  • PDF
Register allocation in the SPUR Lisp compiler
  • 52
  • PDF
Register Allocation by Evolutionary Algorithm
  • 2
...
1
2
3
4
5
...

References