Register Allocation Via Coloring

@article{Chaitin1981RegisterAV,
  title={Register Allocation Via Coloring},
  author={Gregory J. Chaitin and M. Auslander and A. K. Chandra and J. Cocke and M. Hopkins and Peter W. Markstein},
  journal={Comput. Lang.},
  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… Expand
571 Citations
An improved approach of register allocation via graph coloring
  • L. Gao, Ce Shi
  • Computer Science, Engineering
  • IS&T/SPIE Electronic Imaging
  • 2005
  • 1
Efficient global register allocation
  • PDF
A generalized algorithm for graph-coloring register allocation
  • 95
  • PDF
Register allocation & spilling via graph coloring
  • 566
  • PDF
Register allocation via graph coloring
  • 148
  • PDF
Optimal Register Allocation in Polynomial Time
  • 20
  • PDF
Live Range Splitting in a Graph Coloring Register Allocator
  • 50
  • PDF
A COMBINED ALGORITHM FOR GRAPH-COLORING IN REGISTER ALLOCATION
  • 9
  • PDF
Register allocation via clique separators
  • 50
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
A program data flow analysis procedure
  • 387
  • PDF
Measurement of Programming Improvement Algorithms
  • 13
On programming : an interim report on the SETL Project
  • 90