| 
|
QuoteRef: freiRA11_1974
topics >
all references >
ThesaHelp:
references e-f
ThesaHelp:
ACM references f-l
Topic:
register allocation by usage counts
Topic:
code optimization by flow analysis
Topic:
register allocation
Reference
Freiburghouse, R.A., "Register allocation via usage counts ", Communications of the ACM , 17, 11, pp. 638-642 , November 1974. Google
Notes
algorithm for register allocation and sub-expression elimination
639 ;;Quote: usage count is number of distinct references to a value in a program
639 ;;Quote: a linear region of a program has one entry and one exit
640 ;;Quote: a register's value should be discarded after last use
640 ;;Quote: if too few registers, need to allocate registers to minimize loads and stores
640 ;;Quote: during code generation model machine state by value assignments and their usage counts
640 ;;Quote: last use of value when its usage count drops to zero
640 ;;Quote: spill the register containing value with the lowest usage count
640 ;;Quote: usages counts used by Gries for last use of temporaries
641 ;;Quote: spilling registers by least usage count better than LRU or least recently loaded
642 ;;Quote: usage counts better than least-recent information since it depends on future instead of past history
ThesaHelp: references e-f (168 items)
ThesaHelp: ACM references f-l (241 items)
Topic: register allocation by usage counts (12 items)
Topic: code optimization by flow analysis (45 items)
Topic: register allocation (28 items)