View : 417 Download: 0

SpDRAM: Efficient In-DRAM Acceleration of Sparse Matrix-Vector Multiplication

Title
SpDRAM: Efficient In-DRAM Acceleration of Sparse Matrix-Vector Multiplication
Authors
Kang, Jieui; Choi, Soeun; Lee, Eunjin; Sim, Jaehyeong
Ewha Authors
심재형
SCOPUS Author ID
심재형scopus
Issue Date
2024
Journal Title
IEEE ACCESS
ISSN
2169-3536JCR Link
Citation
IEEE ACCESS vol. 12, pp. 176009 - 176021
Keywords
Random access memory; Sparse matrices; Computer architecture; Logic; Vectors; Turning; System-on-chip; Space exploration; Sorting; SRAM cells; Processing-in-memory; SpMV; sparsity; DRAM
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Indexed
SCIE; SCOPUS WOS
Document Type
Article
Abstract
We introduce novel sparsity-aware in-DRAM matrix mapping techniques and a correspondingDRAM-based acceleration framework, termedSpDRAM, which utilizes a triple row activation schemeto efficiently handle sparse matrix-vector multiplication (SpMV). We found that reducing operationsby sparsity relies heavily on how matrices are mapped into DRAM banks, which operate row byrow. These banks operate row by row. From this insight, we developed two distinct matrix mappingtechniques aimed at maximizing the reduction of row operations with minimal design overhead: Output-aware Matrix Permutation (OMP) and Zero-aware Matrix Column Sorting (ZMCS). Additionally,we propose a Multiplication Deferring (MD) scheme that leverages the prevalent bit-level sparsity inmatrix values to decrease the effective bit-width required for in-bank multiplication operations. Evaluationresults demonstrate that the combination of our in-DRAM acceleration methods outperforms the latestDRAM-based PIM accelerator for SpMV, achieving a performance increase of up to 7.54xand a 22.4ximprovement in energy efficiency in a wide range of SpMV tasks
DOI
10.1109/ACCESS.2024.3505622
Appears in Collections:
인공지능대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE