Buffets

Michael Pellauer, Yakun Sophia Shao, Jason Clemons et al. · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · 2019

Accelerators spend significant area and effort on custom on-chip buffering. Unfortunately, these solutions are strongly tied to particular designs, hampering re-usability across other accelerators or domains. We present buffets, an efficient and composable storage idiom for the needs of accelerators that is independent of any particular design. Buffets have several distinguishing characteristics, including efficient decoupled fills and accesses with fine-grained synchronization, hierarchical composition, and efficient multi-casting. We implement buffets in RTL and show that they only add 2% control overhead over an 8KB RAM. When compared with DMA-managed double-buffered scratchpads and caches across a range of workloads, buffets improve energy-delay-product by 1.53x and 5.39x, respectively.

Cited by 91 works. doi:10.1145/3297858.3304025 Open-access PDF

Authors

References