Bit-Parallel Vector Composability for Neural Acceleration
Not on the map. Why?
Abstract (arXiv)
Conventional neural accelerators rely on isolated self-sufficient functional units that perform an atomic operation while communicating the results through an operand delivery-aggregation logic. Each single unit processes all the bits of their operands atomically and produce all the bits of the results in isolation. This paper explores a different design style, where each unit is only responsible for a slice of the bit-level operations to interleave and combine the benefits of bit-level parallelism with the abundant data-level parallelism in deep neural networks. A dynamic collection of these units cooperate at runtime to generate bits of the results, collectively. Such cooperation requires extracting new grouping between the bits, which is only possible if the operands and operations are vectorizable. The abundance of Data Level Parallelism and mostly repeated execution patterns, provides a unique opportunity to define and leverage this new dimension of Bit-Parallel Vector Composability. This design intersperses bit parallelism within data-level parallelism and dynamically interweaves the two together. As such, the building block of our neural accelerator is a Composable Vector Unit that is a collection of Narrower-Bitwidth Vector Engines, which are dynamically composed or decomposed at the bit granularity. Using six diverse CNN and LSTM deep networks, we evaluate this design style across four design points: with and without algorithmic bitwidth heterogeneity and with and without availability of a high-bandwidth off-chip memory. Across these four design points, Bit-Parallel Vector Composability brings (1.4x to 3.5x) speedup and (1.1x to 2.7x) energy reduction. We also comprehensively compare our design style to the Nvidia RTX 2080 TI GPU, which also supports INT-4 execution. The benefits range between 28.0x and 33.7x improvement in Performance-per-Watt.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 0; 2024: 0; 2025: 1.
4 papers.
- 2022Sparse Attention Acceleration with Synergistic In-Memory Pruning and On-Chip Recomputationcited by 12
- 2022Accelerating Attention through Gradient-Based Learned Runtime Pruningcited by 8
- 2022PalQuant: Accelerating High-precision Networks on Low-precision Acceleratorscited by 2
- 2025QUILL: An Algorithm-Architecture Co-Design for Cache-Local Deformable Attentioncited by 0
- 2025QUILL: An Algorithm-Architecture Co-Design for Cache-Local Deformable Attention17 Nov 2025
- 2022Sparse Attention Acceleration with Synergistic In-Memory Pruning and On-Chip Recomputation1 Sep 2022
- 2022PalQuant: Accelerating High-precision Networks on Low-precision Accelerators3 Aug 2022
- 2022Accelerating Attention through Gradient-Based Learned Runtime Pruning7 Apr 2022