Early DSE and Automatic Generation of Coarse Grained Merged Accelerators
Iulian Brumar, Georgios Zacharopoulos, Yuan Yao, Saketh Rama, Gu-Yeon, Wei, and David Brooks

TL;DR
This paper introduces AccelMerger, an automated method for creating coarse-grained, merged accelerators that optimize area and performance in FPGA systems without manual tuning.
Contribution
It presents the first automated approach to generate merged accelerators using sequence alignment and neural networks, improving design efficiency and performance.
Findings
Achieves up to 16.7x application speedup on FPGA.
Reduces accelerator area by up to 99%.
Outperforms existing early-stage exploration tools.
Abstract
Post-Moore's law area-constrained systems rely on accelerators to deliver performance enhancements. Coarse grained accelerators can offer substantial domain acceleration, but manual, ad-hoc identification of code to accelerate is prohibitively expensive. Because cycle-accurate simulators and high-level synthesis flows are so time-consuming, manual creation of high-utilization accelerators that exploit control and data flow patterns at optimal granularities is rarely successful. To address these challenges, we present AccelMerger, the first automated methodology to create coarse grained, control- and data-flow-rich, merged accelerators. AccelMerger uses sequence alignment matching to recognize similar function call-graphs and loops, and neural networks to quickly evaluate their post-HLS characteristics. It accurately identifies which functions to accelerate, and it merges accelerators to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · VLSI and Analog Circuit Testing · Embedded Systems Design Techniques
