Verification Challenges in Sparse Matrix Vector Multiplication in High Performance Computing: Part I
By: Junchao Zhang
Potential Business Impact:
Speeds up computer math for science.
Sparse matrix vector multiplication (SpMV) is a fundamental kernel in scientific codes that rely on iterative solvers. In this first part of our work, we present both a sequential and a basic MPI parallel implementations of SpMV, aiming to provide a challenge problem for the scientific software verification community. The implementations are described in the context of the PETSc library.
Similar Papers
Toward Efficient SpMV in Sparse LLMs via Block Extraction and Compressed Storage
Distributed, Parallel, and Cluster Computing
Makes AI models run much faster and smaller.
A Nonlinear Hash-based Optimization Method for SpMV on GPUs
Distributed, Parallel, and Cluster Computing
Makes computer math problems run much faster.
MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
Machine Learning (CS)
Makes AI models use less memory and run faster.