An efficient gustavson-based sparse matrix-matrix multiplication accelerator on embedded FPGAs
Sparse-matrix sparse-matrix multiplication (SpMM) is an important kernel in multiple areas, e.g., data analytics and machine learning. Due to the low on-chip memory requirement, the consistent data format, and the simplified control logic, the Gustavson’s algorithm is a promising backbone algorithm...
Main Authors: | Li, Shiqing, Huai, Shuo, Liu, Weichen |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/169151 |
Similar Items
-
Accelerating gustavson-based SpMM on embedded FPGAs with element-wise parallelism and access pattern-aware caches
by: Li, Shiqing, et al.
Published: (2023) -
Optimized data reuse via reordering for sparse matrix-vector multiplication on FPGAs
by: Li, Shiqing, et al.
Published: (2022) -
Efficient FPGA-based sparse matrix-vector multiplication with data reuse-aware compression
by: Li, Shiqing, et al.
Published: (2023) -
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)