Skip to search formSkip to main contentSkip to account menu

Chaitin's algorithm

Known as: Chaitin algorithm, Register coloring, Register colouring 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmGraph coloringList of algorithmsOptimizing compiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
COMPUTING FROM PROJECTIONS OF RANDOM POINTS : A DENSE HIERARCHY OF SUBIDEALS OF THE
We study the sets that are computable from both halves of some (Martin-Löf) random sequence, which we call 1{2-bases. We show… 
2011
2011
More about "Research in Ambiguous, Conflictual, and Changing Contexts": Studying Ethnic Populations in China, Xi'an to Urumqi.
In their recent article in this journal entitled, Undertaking Qualitative Research in Ambiguous, Conflictual, and Changing… 
2008
2008
The integrated register allocator for GCC
The current GCC register allocator, like the classical Briggs and George/Appel register allocators consists of different passes… 
2007
2007
Software Pipelining with Reduced Register Requirement (cid:3)
Although it is well-known that a strong interaction exists between software pipelining and register allocation, simultaneous… 
2007
2007
Improving Pegasus Schedules With the C 6 x AGU
The growing adoption of high-level programming on DSPs demands high-quality code from compilers. Many architectures feature… 
2002
2002
Global array reference allocation
Embedded systems executing specialized programs have been increasingly responsible for a large share of the computer systems… 
2002
2002
A COMBINED ALGORITHM FOR GRAPH-COLORING IN REGISTER ALLOCATION
Our research involves improved algorithms for graph-coloring, in the context of register allocation. We extend the usual… 
2002
2002
Generalizing Chaitin's Algorithm: Graph-Coloring Register Allocation for Irregular Architectures
1997
1997
Look-ahead allocation in the presence of branches
Most current register allocators utilize a register coloring algorithm. They use varied heuristics to decide which live ranges to… 
1992
1992
Program structure as a basis for the parallelization of global compiler optimizations
Optimizing compilers can produce very efficient code but incur a high compilation cost. Because interactions between arbitrary… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)