Corpus ID: 60112921

Register allocation via graph coloring

@inproceedings{Chaitin1981RegisterAV,
  title={Register allocation via graph coloring},
  author={G. Chaitin and M. Auslander and A. K. Chandra and J. Cocke and M. Hopkins and Peter W. Markstein},
  year={1981}
}
The basic idea behind register allocation via graph coloring is to reduce register spillage by globally assigning variables to registers across an entire program module via the five basic steps below: I. Assign each object (intermediate result name, variable, or constant) to a distinct symbolic register called si. Re-constitute the intermediate code with the assigned symbolic registers. II. Perform live range analysis using the re-constituted intermediate code. A variable is live from the time… Expand
148 Citations
Global Register Allocation Based on Graph Fusion
  • 24
  • Highly Influenced
  • PDF
Register Allocation via Hierarchical Graph Coloring
  • 64
Global Reduction of Spill Code by Live Range Splitting
  • 1
Fusion-based register allocation
  • 46
Register Spilling and Live-Range Splitting for SSA-Form Programs
  • 23
  • Highly Influenced
  • PDF
Improvements to graph coloring register allocation
  • 394
  • Highly Influenced
  • PDF
Approaches to Enhance Graph Coloring Register Allocation
  • 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Register Allocation Via Coloring
  • 573
  • PDF
Register allocation and spilling via graph coloring
  • 558
  • PDF
Register Allocation in Optimizing Compilers
  • 35
The Complexity of Near-Optimal Graph Coloring
  • 281
Some Simplified NP-Complete Graph Problems
  • 2,049
The Generation of Optimal Code for Arithmetic Expressions
  • 304
ALPHA—An Automatic Programming System of High Efficiency
  • 36
Optimal code generation for expression trees
  • 109
...
1
2
3
...