| 
|
QuoteRef: brigP6_1989
topics >
all references >
ThesaHelp:
ACM references a-e
Topic:
register allocation by graph coloring
Reference
Briggs, P., Cooper, K.D., Kennedy, K., Torczon, L., "Coloring heuristics for register allocation", Proceedings of the ACM SIGPLAN89 Conference of Programming Language Design and Implementation, Portland, Oregon, USA, June 1989, pp. 275-284. Google
Other Reference
reprinted, p. 283-294 in 20 Years of the ACM/SIGPLAN Conference of Programming Language Design and Implementation (1979-1999): A selection, ACM SIGPLAN 39.4, April 2004.
retrospective ;;Quote: improved graph coloring algorithm for register allocation; attempts to color spilled code; 22% cost reduction, especially large routines
ThesaHelp: ACM references a-e (259 items)
Topic: register allocation by graph coloring (21 items)