Peephole optimization

@article{McKeeman1965PeepholeO,
  title={Peephole optimization},
  author={William M. McKeeman},
  journal={Commun. ACM},
  year={1965},
  volume={8},
  pages={443-444}
}
Redundant instructions may be discarded during the final stage of compilation by using a simple optimizing technique called peephole optimization. The method is described and examples are given. 

Aspect structure of compilers

This thesis demonstrates how modularity-issues in compilers can be addressed with the help of a relatively new, yet powerful programming paradigm called aspect-oriented programming.

Superoptimisation : provably optimal code generation using answer set programming

The validity of the approach of superoptimisation using Answer Set Programming is demonstrated by optimising code sequences for two 32-bit RISC architectures, the MIPS R2000 and the SPARC V8, by generating libraries of equivalence classes of all op­ timal instruction sequences of a given length for a specific microprocessor architecture.

A Pattern Matching-Based Framework for Quantum Circuit Rewriting

This work proposes a pattern matching-based framework for rewriting quantum circuits, called QRewriting, which takes advantage of a new representation of quantum circuits using symbol sequences and proposes a polynomial-time dynamic programming-based pattern matching and replacement algorithm.

Lasagne: a static binary translator for weak memory model architectures

Lasagne is proposed, an end-to-end static binary translator with precise translation rules between x86 and Arm concurrency semantics and a concurrency model for Lasagne’s intermediate representation (IR) and formally proved mappings between the IR and the two architectures.

SUPEROPTIMIZE REAL-WORLD PROGRAMS

  • 2022

Not All SWAPs Have the Same Cost: A Case for Optimization-Aware Qubit Routing

  • Ji LiuPeiyi LiHuiyang Zhou
  • Computer Science
    2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)
  • 2022
NASSC (Not All Swaps have the Same Cost) is the first algorithm that considers the subsequent optimizations during the routing step, and optimization-aware qubit routing leads to better routing decisions and benefits subsequent optimizations.

Hidden Inverses: Coherent Error Cancellation at the Circuit Level

Bichen Zhang, 2, ∗ Swarnadeep Majumder, 2 Pak Hong Leung, 3 Stephen Crain, 2, † Ye Wang, 2 Chao Fang, 2 Dripto M. Debroy, 3, ‡ Jungsang Kim, 2, 3, 4 and Kenneth R. Brown 2, 3, 5, ∗ Duke Quantum

Multi-Sensor, Active Fire-Supervised, One-Class Burned Area Mapping in the Brazilian Savanna

This work developed a multi-sensor, active fire-supervised, one-class BA mapping algorithm suitable to improve fire regime characterization and validation of coarse resolution products and is capable of supporting improved regional emissions estimates.

Learning to Superoptimize Real-world Programs

A framework to learn to superoptimize real-world programs by using neural sequence-to-sequence models, and an approach to implement and outperforms a standard policy gradient learning approach on this dataset.

Rewrite rule inference using equality saturation

This paper explores how equality saturation, a promising technique that uses e-graphs to apply rewrite rules, can also be used to infer rewriterules, and prototyped a tool dubbed Ruler, which synthesizes 5.8× smaller rulesets 25× faster without compromising on proving power.
...