Coloring heuristics for register allocation
Preston Briggs, Keith D. Cooper, Ken Kennedy, Linda Torczon · ACM SIGPLAN Notices · 2004
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.