SEER: Super-Optimization Explorer for HLS using E-graph Rewriting with MLIR
Not on the map. Why?
Abstract (arXiv)
High-level synthesis (HLS) is a process that automatically translates a software program in a high-level language into a low-level hardware description. However, the hardware designs produced by HLS tools still suffer from a significant performance gap compared to manual implementations. This is because the input HLS programs must still be written using hardware design principles. Existing techniques either leave the program source unchanged or perform a fixed sequence of source transformation passes, potentially missing opportunities to find the optimal design. We propose a super-optimization approach for HLS that automatically rewrites an arbitrary software program into efficient HLS code that can be used to generate an optimized hardware design. We developed a toolflow named SEER, based on the e-graph data structure, to efficiently explore equivalent implementations of a program at scale. SEER provides an extensible framework, orchestrating existing software compiler passes and hardware synthesis optimizers. Our work is the first attempt to exploit e-graph rewriting for large software compiler frameworks, such as MLIR. Across a set of open-source benchmarks, we show that SEER achieves up to 38x the performance within 1.4x the area of the original program. Via an Intel-provided case study, SEER demonstrates the potential to outperform manually optimized designs produced by hardware experts.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 10 of its 62 references that are in the map. First posted on arXiv 15 Aug 2023.
Builds on
10 of 62 references.
References · 10
- 2018A Survey on Compiler Autotuning using Machine Learningcited by 40
- 2021ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representationcited by 21
- 2019AutoPhase: Compiler Phase-Ordering for High Level Synthesis with Deep Reinforcement Learningcited by 12
- 2022FlowTune: End-to-end Automatic Logic Optimization Exploration via Domain-specific Multi-armed Banditcited by 11
- 2021Rewrite Rule Inference Using Equality Saturationcited by 10
- 2021Pure Tensor Program Rewriting via Access Patterns (Representation Pearl)cited by 7
- 2023Automating Constraint-Aware Datapath Optimization using E-Graphscited by 5
- 2022Automatic Datapath Optimization using E-Graphscited by 4
- 2022Small Proofs from Congruence Closurecited by 3
- 2022Combining E-Graphs with Abstract Interpretationcited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.