Efficient Memory Partitioning in Software Defined Hardware
Not on the map. Why?
Abstract (arXiv)
As programmers turn to software-defined hardware (SDH) to maintain a high level of productivity while programming hardware to run complex algorithms, heavy-lifting must be done by the compiler to automatically partition on-chip arrays. In this paper, we introduce an automatic memory partitioning system that can quickly compute more efficient partitioning schemes than prior systems. Our system employs a variety of resource-saving optimizations and an ML cost model to select the best partitioning scheme from an array of candidates. We compared our system against various state-of-the-art SDH compilers and FPGAs on a variety of benchmarks and found that our system generates solutions that, on average, consume 40.3% fewer logic resources, 78.3% fewer FFs, 54.9% fewer Block RAMs (BRAMs), and 100% fewer DSPs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 46 references that are in the map. First posted on arXiv 2 Feb 2022.
Builds on
3 of 46 references.
References · 3
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2018Accelerating CNN inference on FPGAs: A Surveycited by 16
- 2016Programming Heterogeneous Systems from an Image Processing DSLcited by 3
Built on by
Not cited yet.