Automatic generation of peephole superoptimizers

Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at exploiting all opportunities for optimization. We explore fully automatic construction of peephole optimizers using brute force superoptimization. While the optimizations discovered by our automatic system may be less general than human-written counterparts, our approach has the potential to automatically learn a database of thousands to millions of optimizations, in contrast to the hundreds found in current peephole optimizers. We show experimentally that our optimizer is able to exploit performance opportunities not found by existing com

• Type: Conference
• Year: 2006
• Where: ASPLOS
• Authors: Sorav Bansal, Alex Aiken
• Keywords: ASPLOS 2006, Current Peephole Optimizers, Pattern Matching Rules, Peephole Optimizers, Programming Languages