pith. sign in

arxiv: 2009.08685 · v1 · pith:V7YOMRQVnew · submitted 2020-09-18 · 💻 cs.LG · cs.AR· stat.ML

GrateTile: Efficient Sparse Tensor Tiling for CNN Processing

classification 💻 cs.LG cs.ARstat.ML
keywords gratetiledatadesignefficientfeatureindexingonlyprocessing
0
0 comments X
read the original abstract

We propose GrateTile, an efficient, hardwarefriendly data storage scheme for sparse CNN feature maps (activations). It divides data into uneven-sized subtensors and, with small indexing overhead, stores them in a compressed yet randomly accessible format. This design enables modern CNN accelerators to fetch and decompressed sub-tensors on-the-fly in a tiled processing manner. GrateTile is suitable for architectures that favor aligned, coalesced data access, and only requires minimal changes to the overall architectural design. We simulate GrateTile with state-of-the-art CNNs and show an average of 55% DRAM bandwidth reduction while using only 0.6% of feature map size for indexing storage.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.