Map
Index
Random
Help
th

Quote: improved graph coloring algorithm for register allocation; attempts to color spilled code; 22% cost reduction, especially large routines

topics > all references > references a-b > QuoteRef: brigP6_1989 , p. retrospective



Topic:
register allocation by graph coloring

Quotation Skeleton

Our paper introduced an improved coloring strategy that … algorithm and Chaitin's algorithm lies in the timing … [a node, our] allocator inserts it into the coloring order. The spill candidate … This technique has been adopted in many commercial … [p. 289] We applied our new coloring heuristic to … the estimated spill costs were reduced by 22%. … Overall, registers were used much more effectively because … [p. 290] In general, it appears that large routines …   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: register allocation by graph coloring (21 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.