| 
|
Quote: register allocation via greedy coloring of chordal graphs; better than iterated register coalescing over a few registers
Topic:
register allocation by graph coloring
Topic:
graphs
Quotation Skeleton
We present a simple algorithm for register allocation … algorithm on the observation that 95% of the … A greedy algorithm can optimally color a chordal … for spilling and coalescing. Our experiments show that … comparable results for settings with many registers. … [p. 316].optimal coloring of a chordal graphs G=(V,E) can … Our algorithm is simple, efficient, and modular, and … graphs. … [p. 318] greedy coloring is optimal for chordal graphs. … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: register allocation by graph coloring (21 items)
Topic: graphs (18 items)