Level-based Blocking for Sparse Matrices: Sparse Matrix-Power-Vector Multiplication

Alappat C, Hager G, Schenk O, Wellein G (2022)


Publication Type: Journal article

Publication year: 2022

Journal

Pages Range: 1-18

DOI: 10.1109/TPDS.2022.3223512

Abstract

The multiplication of a sparse matrix with a dense vector (SpMV) is a key component in many numerical schemes and its performance is known to be severely limited by main memory access. Several numerical schemes require the multiplication of a sparse matrix polynomial with a dense vector which is typically implemented as a sequence of SpMVs. This results in low performance and ignores the potential to increase the arithmetic intensity by reusing the matrix data from cache. In this work we use the recursive algebraic coloring engine (RACE) to enable blocking of sparse matrix data across the polynomial computations. In the graph representing the sparse matrix we form levels using a breadth-first search. Locality relations of these levels are then used to improve spatial and temporal locality when accessing the matrix data and to implement an efficient multithreaded parallelization. Our approach is independent of the matrix structure and avoids shortcomings of existing “blocking” strategies in terms of hardware efficiency and parallelization overhead. We quantify the quality of our implementation using performance modelling and demonstrate speedups of up to 3× and 5× compared to an optimal SpMV-based baseline on a single multicore chip of recent Intel and AMD architectures. Various numerical schemes like s-step Krylov solvers, polynomial preconditioners and power clustering algorithms will benefit from our development.

Authors with CRIS profile

Involved external institutions

How to cite

APA:

Alappat, C., Hager, G., Schenk, O., & Wellein, G. (2022). Level-based Blocking for Sparse Matrices: Sparse Matrix-Power-Vector Multiplication. IEEE Transactions on Parallel and Distributed Systems, 1-18. https://doi.org/10.1109/TPDS.2022.3223512

MLA:

Alappat, Christie, et al. "Level-based Blocking for Sparse Matrices: Sparse Matrix-Power-Vector Multiplication." IEEE Transactions on Parallel and Distributed Systems (2022): 1-18.

BibTeX: Download