The document describes an automatic approach to generating peephole superoptimizers. It discusses: 1) Using an enumerator to exhaustively generate candidate instruction sequences to find optimal replacements for harvested target sequences from training programs. 2) A design that includes canonicalization to handle register/constant renaming, fingerprinting to map sequences to targets, and an equivalence test comprising execution and boolean checks. 3) Experimental results showing the approach finds significant optimizations, improving optimized code by 1-10x, with some rules used over 1000 times.

1. Automatic Generation of Peephole Superoptimizers Speaker:Shuai-wei Huang Advisor:Wuu Yang Sorav Bansal and Alex Aiken Computer System Lab Stanford University ASPLOS’06

2. Contents 2. Design of the Optimizer 1. Introduction 3. Experimental Results 4. Conclusion

10. Design of the Optimizer - Flowchart

15. Design of the Optimizer – Canonicalization(3/3)

20. Design of the Optimizer – Enumerate(2/6)

21. Design of the Optimizer – Enumerate(3/6)

24. Design of the Optimizer – Enumerate(6/6)

33. Thank You !