Quote: graph-coloring usually makes invalid assumptions about register interchangeability and independence

Quotation Skeleton

[For register allocation by graph-coloring] two assumptions at the heart of the … Registers are interchangeable if they are equally suitable … another. … In this paper, we generalize the graph-coloring approach … register-allocation pass that is as elegant and practical … [p. 278] The [register] alias map and the grouping … [of interchangeable registers] are the only properties needed to target our allocator. … [p. 283] The traditional allocator uses the criterion degree_n … [i.e., the conflicts for a node are less than the number of registers] Our generalization replaces that test with squeeze_n < |class_n|. In … calls). … our implementation associates an excluded-register set with each …   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: graph-coloring register allocation with register aliases and groups of interchangeable registers; constant time test for trivial colorability

Related Topics

Topic: register allocation by graph coloring (21 items)