Pith. sign in

REVIEW

Communication Bounds for Convolutional Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.08279 v1 pith:IHGIRJNE submitted 2022-04-18 cs.DC cs.CCcs.DS

classification cs.DCcs.CCcs.DS
keywords performanceboundscommunicationconvolutionaldatalearningmachinememory
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Convolutional neural networks (CNNs) are important in a wide variety of machine learning tasks and applications, so optimizing their performance is essential. Moving words of data between levels of a memory hierarchy or between processors on a network is much more expensive than the cost of arithmetic, so minimizing communication is critical to optimizing performance. In this paper, we present new lower bounds on data movement for mixed precision convolutions in both single-processor and parallel distributed memory models, as well as algorithms that outperform current implementations such as Im2Col. We obtain performance figures using GEMMINI, a machine learning accelerator, where our tiling provides improvements between 13% and 150% over a vendor supplied algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools