Coloring heuristics for register allocation

  • Authors:
  • P. Briggs;K. D. Cooper;K. Kennedy;L. Torczon

  • Affiliations:
  • Department of Computer Science, Rice University, Houston, TX;Department of Computer Science, Rice University, Houston, TX;Department of Computer Science, Rice University, Houston, TX;Department of Computer Science, Rice University, Houston, TX

  • Venue:
  • PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe an improvement to a heuristic introduced by Chaitin for use in graph coloring register allocation. Our modified heuristic produces better colorings, with less spill code. It has similar compile-time and implementation requirements. We present experimental data to compare the two methods.