Th QuoteRef: smitMD6

QuoteRef: smitMD6_2004

topics > all references > ThesaHelp: references sa-sz

ThesaHelp:
ACM references m-z
Topic:
register allocation by graph coloring

Reference

Smith, M.D., Ramsey, N., Holloway, G., "A generalized algorithm for graph-coloring register allocation", Proceedings of the 2004 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'04), Washington, DC, USA, June 2004, ACM SIGPLAN, pp. 277-288. Google

Quotations

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

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

Related Topics

ThesaHelp: ACM references m-z (280 items)
Topic: register allocation by graph coloring (21 items)