Learned Approximate Computing: Algorithm Hardware Co-Optimization
Approximate hardware trades acceptable error for improved performance and previous literature focuses on optimizing this tradeoff in the hardware. We show in this article that the application and the hardware can be co-optimized to achieve the best-quality-performance tradeoff. We propose LAC: learned approximate computing to optimize the algorithm and approximate hardware at the same time to maximize quality of output. Our approach allows automatic selection of approximate computing hardware while achieving similar quality as dedicated training for a single hardware configuration. Our improved training algorithm allows simultaneous hardware selection and application optimization without additional runtime overhead. Multihardware setup chooses a separate approximate hardware for each part of an application which allows for more hardware configurations and further improves quality.
Authors
- Tianmu Li (ORCID: https://orcid.org/0000-0002-1078-6743)
- Vaibhav Gupta (ORCID: https://orcid.org/0000-0001-5272-0438)
- Puneet Gupta (ORCID: https://orcid.org/0000-0002-6188-1134)
- Egor Glukhov (ORCID: https://orcid.org/0009-0003-6284-5367)
Institutions
- University of California, Los Angeles (US)
Publication Details
- Journal
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Published
- 2024-08-20
- DOI
- https://doi.org/10.1109/tcad.2024.3446724
- Citations
- 1
- Primary Topic
- Low-power high-performance VLSI design
- Type
- article
- Field-Weighted Citation Impact
- 0.21