CoSpMV: Towards Agile Software and Hardware Co-Design for SpMV Computation

Sparse Matrix-Vector multiplication (SpMV) is a widely used kernel in scientific or engineering applications and it is commonly implemented in FPGAs for acceleration. Existing works on FPGA usually pre-process the sparse matrix for data compression from the software perspective, and then design a unified architecture from the hardware perspective. However, as different SpMV kernels expose different levels of data parallelism after software processing, a unified architecture may not efficiently tap the underlying parallelism exposed in a specific kernel, leading to poor bandwidth utilization (BU) or poor resource utilization. To this end, this paper proposes an agile software and hardware co-design framework, CoSpMV, that employs design space exploration on both software and hardware for a specific kernel. Specifically, by providing a scalable compressed data format and a highly pipelined hardware template, CoSpMV can select the most suitable software and hardware configurations for different kernels and generate the accelerator instantly. The experimental results show that CoSpMV can achieve 3.91<inline-formula><tex-math notation="LaTeX">$\times$</tex-math></inline-formula> speedup on GFLOPs, and 1.31<inline-formula><tex-math notation="LaTeX">$\times$</tex-math></inline-formula> speedup on BU compared to the state-of-the-art work.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computers
Published
2025-02-28
DOI
https://doi.org/10.1109/tc.2025.3547136
Citations
2
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
2.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CoSpMV: Towards Agile Software and Hardware Co-Design for SpMV Computation

Bowen Liu, Minghao Tian, Yue Liang, Dajiang Liu
2 citations
IEEE Transactions on Computers
Age of Information Optimization
2.97
article

CoSpMV: Towards Agile Software and Hardware Co-Design for SpMV Computation

Bowen Liu, Minghao Tian, Yue Liang, Dajiang Liu
article en
2 citations

Abstract

Sparse Matrix-Vector multiplication (SpMV) is a widely used kernel in scientific or engineering applications and it is commonly implemented in FPGAs for acceleration. Existing works on FPGA usually pre-process the sparse matrix for data compression from the software perspective, and then design a unified architecture from the hardware perspective. However, as different SpMV kernels expose different levels of data parallelism after software processing, a unified architecture may not efficiently tap the underlying parallelism exposed in a specific kernel, leading to poor bandwidth utilization (BU) or poor resource utilization. To this end, this paper proposes an agile software and hardware co-design framework, CoSpMV, that employs design space exploration on both software and hardware for a specific kernel. Specifically, by providing a scalable compressed data format and a highly pipelined hardware template, CoSpMV can select the most suitable software and hardware configurations for different kernels and generate the accelerator instantly. The experimental results show that CoSpMV can achieve 3.91<inline-formula><tex-math notation="LaTeX">$\times$</tex-math></inline-formula> speedup on GFLOPs, and 1.31<inline-formula><tex-math notation="LaTeX">$\times$</tex-math></inline-formula> speedup on BU compared to the state-of-the-art work.

IEEE Transactions on ComputersVol. 74(6)
Chongqing University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 10%
Age of Information Optimization
2.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.