Work

Verification Challenges in Sparse Matrix Vector Multiplication in High Performance Computing: Part I

Year: 2025

Type: article

Abstract: 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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.432.11

Author: Junchao Zhang

Institution: Argonne National Laboratory

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: U.S. Department of Energy, Office of Science