Corpus ID: 1335916

Live-range Unsplitting for Faster Optimal Coalescing ( extended version )

@inproceedings{Blazy2008LiverangeUF,
  title={Live-range Unsplitting for Faster Optimal Coalescing ( extended version )},
  author={Sandrine Blazy and Beno{\^i}t Robillard},
  year={2008}
}
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting after each statement) enables optimal solutions based on ILP, for both spilling and coalescing. However, while the solutions are easily found for spilling, for coalescing they are more elusive. This difficulty stems from the huge size of interference graphs resulting from live-range splitting. This report focuses on… Expand
1 Citations
Live-range unsplitting for faster optimal coalescing
  • 6
  • PDF

References

SHOWING 1-10 OF 27 REFERENCES
On the Complexity of Register Coalescing
  • 48
  • PDF
A Fast Cutting-Plane Algorithm for Optimal Coalescing
  • 35
  • PDF
Optimal spilling for CISC machines with few registers
  • 153
  • PDF
Optimistic register coalescing
  • 45
Iterated register coalescing
  • 177
  • PDF
Improvements to graph coloring register allocation
  • 393
  • PDF
Register allocation and spilling via graph coloring
  • 558
  • PDF
...
1
2
3
...