| 
|
QuoteRef: poleM9_1999
topics >
all references >
ThesaHelp:
references p-r
ThesaHelp:
ACM references m-z
Topic:
register allocation
Topic:
register allocation by graph coloring
Reference
Poletto, M., Sarkar, V., "Linear scan register allocation", ACM Transactions on Programming Languages and Systems, 21, 5, September 1999, pp. 895-913. Google
abstract ;;Quote: use linear scan for global register allocation; up to several times faster than graph coloring, within 12% as efficient
897 ;;Quote: binpacking generates better code than linear scan but 2-3x slower; keeps track of lifetime holes
898 ;;Quote: linear scan determines the live interval of a variable in the intermediate representation; needs live variable information from data-flow analysis
904 ;;Quote: if 512 simultaneously live variables, linear scan is 600x faster than graph coloring; due to coloring's O(n^2) time for the interference graph
907 ;;Quote: linear scan overhead for live variable analysis and construction of live intervals; experimented with strongly-connected components, but poor code
ThesaHelp: references p-r (245 items)
ThesaHelp: ACM references m-z (280 items)
Topic: register allocation (28 items)
Topic: register allocation by graph coloring (21 items)