Accelerating gustavson-based SpMM on embedded FPGAs with element-wise parallelism and access pattern-aware caches
The Gustavson’s algorithm (i.e., the row-wise product algorithm) shows its potential as the backbone algorithm for sparse matrix-matrix multiplication (SpMM) on hardware accelerators. However, it still suffers from irregular memory accesses and thus its performance is bounded by the off-chip memory...
Saved in:
Main Authors: | Li, Shiqing, Liu, Weichen |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/167477 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An efficient gustavson-based sparse matrix-matrix multiplication accelerator on embedded FPGAs
by: Li, Shiqing, et al.
Published: (2023) -
Efficient FPGA-based sparse matrix-vector multiplication with data reuse-aware compression
by: Li, Shiqing, et al.
Published: (2023) -
PARALLEL GRAPH PROCESSING ACCELERATORS ON FPGAS
by: CHEN XINYU
Published: (2022) -
Accelerating sparse matrix operations on FPGAs with on/off-chip memories
by: Li, Shiqing
Published: (2023) -
An efficient sparse LSTM accelerator on embedded FPGAs with bandwidth-oriented pruning
by: Li, Shiqing, et al.
Published: (2023)