Chaitin's algorithm is a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric. It is named after its designer, Gregory Chaitin. Chaitin's algorithm was the first register allocation algorithm that made use of coloring of the interference graph for both register allocations and spilling.
Chaitin's algorithm was presented on the 1982 SIGPLAN Symposium on Compiler Construction, and published in the symposium proceedings. It was extension of an earlier 1981 paper on the use of graph coloring for register allocation. Chaitin's algorithm formed the basis of a large section of research into register allocators.
References
edit- Gregory Chaitin (April 2004). "Register allocation and spilling via graph coloring". ACM SIGPLAN Notices. 39 (4): 66–74. doi:10.1145/989393.989403. S2CID 23108905.
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |