ABSTRACT
With the successful application of hardware agile design methodology, it has become a big challenge to optimize the design in novelly defined intermediate representations (IR), such as FIRRTL. However, there is little work focusing on this challenge, or the optimization tasks are left to logic synthesizers by translating IRs into designs in hardware description languages (HDL).
In this paper, we propose a novel method based on equality saturation to optimize design in IR forms. For the given optimization goal, the proposed method is able to optimize a circuit in IR form with mixed word- and bit-level components. The promising experimental results show that the proposed method can really optimize a design in IR form. Furthermore, when taking the number of cells as the optimization goal, the proposed method could achieve up to 28.62% reduction when compared with FIRRTL native optimization techniques.
- Yunsup Lee, Andrew Waterman, and Henry Cook. 2016. An Agile Approach to Building RISC-V Microprocessors. IEEE Micro 36, 2 (2016), 8--20. https://doi.org/10.1109/MM.2016.11Google ScholarDigital Library
- Adam M. Izraelevitz, Jack Koenig, and Patrick Li. 2017. Reusability is FIRRTL ground: Hardware construction languages, compiler frameworks, and transformations. In ICCAD 2017. IEEE, 209--216. https://doi.org/10.1109/ICCAD.2017.8203780Google ScholarDigital Library
- Deeksha Dangwal, Georgios Tzimpragos, and Timothy Sherwood. 2020. Agile Hardware Development and Instrumentation With PyRTL. IEEE Micro 40, 4(2020), 76--84. https://doi.org/10.1109/MM.2020.2997704Google ScholarCross Ref
- Ross Daly, Lenny Truong, and Pat Hanrahan. 2018. Invoking and Linking Generators from Multiple Hardware Languages using CoreIR.Google Scholar
- Gopalakrishnan Sivaram and Kalla Priyank. 2009. Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis. In 2009 Design, Automation & Test in Europe Conference & Exhibition. 1452--1457. https://doi.org/10.1109/DATE.2009.5090892Google Scholar
- Ajay K. Verma and Paolo Ienne. 2006. Towards the automatic exploration of arithmetic-circuit architectures. In DAC 2006. ACM, 445--450. https://doi.org/10.1145/1146909.1147027Google ScholarDigital Library
- Sumit Gupta, Rajesh Gupta, and Nikil Dutt. 2004. SPARK: A Parallelizing Approach to the High-Level Synthesis of Digital Circuits. Springer US.Google Scholar
- Max Willsey, Chandrakana Nandi, and Yisu Remy Wang. 2021. egg: Fast and extensible equality saturation. Proc. ACM Program. Lang. 5, POPL (2021), 1--29. https://doi.org/10.1145/3434304Google ScholarDigital Library
- Nelson Charles Gregory. 1980. Techniques for Program Verification. Ph. D. Dissertation. Stanford University, United States-California. AAI8011683.Google Scholar
- Ross Tate, Michael Stepp, and Zachary Tatlock. 2011. Equality Saturation: A New Approach to Optimization. Log. Methods Comput. Sci. 7, 1 (2011). https://doi.org/10.2168/LMCS-7(1:10)2011Google Scholar
- Max Willsey. 2021. Practical and Flexible Equality Saturation. Ph. D. Dissertation. University of Washington, USA. https://hdl.handle.net/1773/47423Google Scholar
- Alexa VanHattum, Rachit Nigam, and Vincent T. Lee. 2021. Vectorization for digital signal processors via equality saturation. In ASPLOS '21: 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Virtual Event, USA, April 19-23, 2021. ACM, 874--886. https://doi.org/10.1145/3445814.3446707Google ScholarDigital Library
- Chandrakana Nandi, Max Willsey, and Adam Anderson. 2020. Synthesizing structured CAD models with equality saturation and inverse transformations. In PLDI 2020. ACM, 31--44. https://doi.org/10.1145/3385412.3386012Google ScholarDigital Library
- Yisu Remy Wang, Shana Hutchison, and Dan Suciu. 2020. SPORES: Sum-Product Optimization via Relational Equality Saturation for Large Scale Linear Algebra. Proc. VLDB Endow. 13, 11 (2020), 1919--1932. http://www.vldb.org/pvldb/vol13/p1919-wang.pdfGoogle ScholarDigital Library
- Chandrakana Nandi, Max Willsey, and Amy Zhu. 2021. Rewrite rule inference using equality saturation. Proc. ACM Program. Lang. 5, OOPSLA (2021), 1--28. https://doi.org/10.1145/3485496Google ScholarDigital Library
- Yichen Yang, Mangpo Phitchaya Phothilimtha, and Yisu Remy Wang. 2021. Equality Saturation for Tensor Graph Superoptimization. CoRR abs/2101.01332 (2021).https://arxiv.org/abs/2101.01332Google Scholar
Index Terms
- ESFO: Equality Saturation for FIRRTL Optimization
Recommendations
egg: Fast and extensible equality saturation
An e-graph efficiently represents a congruence relation over many expressions. Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to ...
Equality saturation: a new approach to optimization
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesOptimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for structuring the ...
Reusability is FIRRTL ground: hardware construction languages, compiler frameworks, and transformations
ICCAD '17: Proceedings of the 36th International Conference on Computer-Aided DesignEnabled by modern languages and retargetable compilers, software development is in a virtual "Cambrian explosion" driven by a critical mass of powerfully parameterized libraries; but hardware development practices lag far behind. We hypothesize that ...
Comments