| 
|
QuoteRef: bansS10_2006
Topic:
code optimization by special case analysis
Topic:
machine code and assembly language
Topic:
object and value equivalence
Reference
Bansal, S., Aiken, A., "Automatic generation of peephole superoptimizers", ACM Symposium on Programming, Languages, and Systems (ASPLOS'06), San Jose, California, USA, October 2006, pp. 394-403. Google
394 ;;Quote: efficient, peephole superoptimizer with thousands of indexed replacement rules; 1.7x to 10x faster than optimized code
395 ;;Quote: peephole optimization by collecting short instruction sequences with a single entry point, multiple exits, and canonical registers and constants
396 ;;Quote: detect equivalent instruction sequences by executing from two pseudo-random machine states and a 256 byte memory; compute fingerprint of the results
Topic: code optimization by special case analysis (22 items)
Topic: machine code and assembly language (49 items)
Topic: object and value equivalence (60 items)