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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2007
01219922007

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Although it is well-known that a strong interaction exists between software pipelining and register allocation, simultaneous… (More)
  • figure 2.1
  • figure 5.1
  • figure 5.2
  • table 1
Is this relevant?
2002
2002
Our research involves improved algorithms for graph-coloring, in the context of register allocation. We extend the usual… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2002
2002
Embedded systems executing specialized programs have been increasingly responsible for a large share of the computer systems… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We describe a system which decompiles (reverse engineers) C programs from target machine code by type-inference techniques. This… (More)
Is this relevant?
1999
1999
A Chaitin-style register allocator often blocks during its simplification phase because no node in the interference graph has a… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
1997
1997
Most current register allocators utilize a register coloring algorithm. They use varied heuristics to decide which live ranges to… (More)
  • table 1
  • figure 2
Is this relevant?
1992
1992
Many architectures require that a program use pairs of adjacent registers to hold double-precision floating-point values… (More)
  • figure 1
  • figure 2
Is this relevant?
1992
1992
Many architectures require that a program use pairs of adjacent registers to hold double-precision oating-point values. Register… (More)
Is this relevant?