| 
|
QuoteRef: leveB7_1980
topics >
all references >
ThesaHelp:
references i-l
ThesaHelp:
ACM references f-l
Topic:
code optimization by instruction reordering or scheduling
Reference
Leverett, B., Szymanski, T.G., "Chaining span-dependent jump instructions", ACM Transactions on Programming Languages and Systems, 2, 3, pp. 274-289, July 1980. Google
274+ ;;Quote: length of a span-dependent instruction depends on distance to operand; e.g., branches
274 ;;Quote: branch chaining: instead of two long jumps, can have short jump to a long jump
275 ;;Quote: algorithm for branch chaining which is linear in program length but exponentional in short jump length
ThesaHelp: references i-l (342 items)
ThesaHelp: ACM references f-l (241 items)
Topic: code optimization by instruction reordering or scheduling (16 items)