Register allocation

Known as: Register allocator, Register spill, Live range 
In compiler optimization, register allocation is the process of assigning a large number of target program variables onto a small number of CPU… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1999
Highly Cited
1999
We describe a new algorithm for fast global register allocation called linear scan. This algorithm is not based on graph coloring… (More)
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We describe two improvements to Chaitin-style graph coloring register allocators. The first, optimistic coloring, uses a stronger… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Software pipelining is an important instruction scheduling technique for efficiently overlapping successive iterations of loops… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Global register allocation plays a major role in determining the efficacy of an optimizing compiler. Graph coloring has been used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We describe an improvement to a heuristic introduced by Chaitin for use in graph coloring register allocation. Our modified… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The classic problem of global register allocation is treated in a heuristic and practical manner by adopting the notion of… (More)
  • figure 1
  • figure 2
  • table 8
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
Atdr..r-R.gin4 alqrioi r.t bc vi.y.d s I g.ph otoinS Fobld. Ea.h rod. in rh. srapn n..th for I cohp{cd qusrry !n.r rBjd6 in r h… (More)
Is this relevant?