Optimized data reuse via reordering for sparse matrix-vector multiplication on FPGAs
Sparse matrix-vector multiplication (SpMV) is of paramount importance in both scientific and engineering applications. The main workload of SpMV is multiplications between randomly distributed nonzero elements in sparse matrices and their corresponding vector elements. Due to irregular data access p...
Saved in:
Main Authors: | Li, Shiqing, Liu, Di, Liu, Weichen |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/155570 |
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) -
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) -
MUGNoC: a software-configured multicast-unicast-gather NoC for accelerating CNN dataflows
by: Chen, Hui, et al.
Published: (2023)