Spill Code Minimization via Interference Region Spilling

@inproceedings{Bergner1997SpillCM,
  title={Spill Code Minimization via Interference Region Spilling},
  author={Peter Bergner and Peter Dahl and David Engebretsen and Matthew T. O'Keefe},
  booktitle={PLDI},
  year={1997}
}
Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling heuristic offers some guidance in reducing the amount of spill code produced. However, this heuristic does not allow the partial spilling of live ranges and the reduction in spill code is limited to a local… CONTINUE READING

Similar Papers

Loading similar papers…