Throughput-Distortion Computation Of Generic Matrix Multiplication: Toward A Computation Channel For Digital Signal Processing Systems
Davide Anastasia, Yiannis Andreopoulos

TL;DR
This paper introduces a novel approach to accelerate GEMM operations in DSP systems by adaptively controlling computation distortion, effectively transforming matrix multiplication into a computation channel that balances throughput and error.
Contribution
It proposes an adaptive scalar companding and packing method for GEMM, deriving an optimal throughput-distortion control framework for broad input data classes.
Findings
Can surpass 100% of peak processor performance under certain distortion levels.
Demonstrated benefits in face recognition and music metadata learning systems.
Provides a new perspective on matrix multiplication as a computation channel.
Abstract
The generic matrix multiply (GEMM) function is the core element of high-performance linear algebra libraries used in many computationally-demanding digital signal processing (DSP) systems. We propose an acceleration technique for GEMM based on dynamically adjusting the imprecision (distortion) of computation. Our technique employs adaptive scalar companding and rounding to input matrix blocks followed by two forms of packing in floating-point that allow for concurrent calculation of multiple results. Since the adaptive companding process controls the increase of concurrency (via packing), the increase in processing throughput (and the corresponding increase in distortion) depends on the input data statistics. To demonstrate this, we derive the optimal throughput-distortion control framework for GEMM for the broad class of zero-mean, independent identically distributed, input sources.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
