Sparse Matrix Multiplication on CAM Based Accelerator

Leonid Yavits, Ran Ginosar

Research output: Working paper / PreprintPreprint

21 Downloads (Pure)

Abstract

Sparse matrix multiplication is an important component of linear algebra computations. In this paper, an architecture based on Content Addressable Memory (CAM) and Resistive Content Addressable Memory (ReCAM) is proposed for accelerating sparse matrix by sparse vector and matrix multiplication in CSR format. Using functional simulation, we show that the proposed ReCAM-based accelerator exhibits two orders of magnitude higher power efficiency as compared to existing sparse matrix-vector multiplication implementations.
Original languageUndefined/Unknown
StatePublished - 28 May 2017

Keywords

  • cs.AR

Cite this