SkyEgg: Heterogeneity-Aware Hardware Synthesis via Equality Saturation
Not on the map. Why?
Abstract (arXiv)
Hardware synthesis is a key interface between high-level programs and accelerator designs. Modern FPGAs increasingly expose heterogeneity in resource functionality and timing configurability. Exploiting these resources requires synthesis to choose among hardware implementations and fine-grained configuration options, and coordinate these choices across multiple stages. However, prior frameworks fail to fully explore these choices due to resource models confined to per-operation mappings and limited fusion patterns. Moreover, they perform transformation, scheduling, and mapping sequentially, selecting an expression form and assigning cycle boundaries before full mapping information is available. This problem precludes chaining and fusion, excludes viable implementations from subsequent optimization stages, and limits end-to-end performance. We present SkyEgg, a heterogeneity-aware hardware synthesis framework for FPGAs. The key insight of SkyEgg is to bring algebraic equivalence and diverse resource capabilities together throughout the synthesis flow. Specifically, it encodes target-specific hardware mappings and configurations as extensible mapping rules alongside algebraic rewrite rules in equality saturation, placing algebraic and resource alternatives in a common representation. It further proposes transformation- and mapping-aware scheduling that uses these alternatives and configuration-specific timing to jointly select an equivalent form, its resource mappings, and cycle assignments to minimize end-to-end latency under target-frequency and hardware constraints. This algebraic exploration reveals forms that enable otherwise unavailable mappings. SkyEgg also provides a heuristic solver that rapidly finds high-quality solutions. Against two commercial HLS tools, SkyEgg achieves average speedups of 3.12x over Vitis HLS and 3.18x over Altera HLS across target frequencies.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 52 references that are in the map. First posted on arXiv 19 Nov 2025.
Builds on
13 of 52 references.
References · 13
- 2020MLIR: A Compiler Infrastructure for the End of Moore's Lawcited by 64
- 2024E-Syn: E-Graph Rewriting with Technology-Aware Cost Functions for Logic Synthesiscited by 7
- 2021A Compiler Infrastructure for Accelerator Generatorscited by 5
- 2022TAPA: A Scalable Task-Parallel Dataflow Programming Framework for Modern FPGAs with Co-Optimization of HLS and Physical Designcited by 5
- 2022Automatic Datapath Optimization using E-Graphscited by 4
- 2023Better Together: Unifying Datalog and Equality Saturationcited by 4
- 2025E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesiscited by 3
- 2023Implementation and Synthesis of Math Library Functionscited by 2
- 2024FPGA Technology Mapping Using Sketch-Guided Program Synthesiscited by 2
- 2024Target-Aware Implementation of Real Expressionscited by 2
- 2023Unifying Static and Dynamic Intermediate Languages for Accelerator Generatorscited by 1
- 2024Subgraph Extraction-based Feedback-guided Iterative Scheduling for HLScited by 1
1 more
Built on by
Citing papers per year: 2026: 1.
1 paper.