Zhang, Y, Li, S, Yuan, F et al. (4 more authors) (2023) Memory-aware Optimization for Sequences of Sparse Matrix-Vector Multiplications. In: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 15-19 May 2023, St Petersburg, Florida, USA. IEEE , pp. 379-389. ISBN 979-8-3503-3767-9
Abstract
This paper presents a novel approach to optimize multiple invocations of a sparse matrix-vector multiplication (SpMV) kernel performed on the same sparse matrix A and dense vector x, like Ax, A 2 x, ⋯, A k x, and their linear combinations such as Ax + A 2 x. Such computations are frequently used in scientific applications for solving linear equations and in multi-grid methods. Existing SpMV optimization techniques typically focus on a single SpMV invocation and do not consider opportunities for optimization across a sequence of SpMV operations (SSpMV), leaving much room for performance improvement. Our work aims to bridge this performance gap. It achieve this by partitioning the sparse matrix into submatrices and devising a new computation pipeline that reduces memory access to the sparse matrix and exploits the data locality of the dense vector of SpMV. Additionally, we demonstrate how our approach can be integrated with parallelization schemes to further improve performance. We evaluate our approach on four distinct multi-core systems, including three ARM and one Intel platform. Experimental results show that our techniques improve the standard implementation and the highly-optimized Intel math kernel library (MKL) by a large margin.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of a conference paper published in 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), made available under the terms of the Creative Commons Attribution License (CC-BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. |
Keywords: | Sparse matrix-vector computation; color reordering parallelizaiton; multi-cores |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number Royal Society IEC\NSFC\191465 |
Depositing User: | Symplectic Publications |
Date Deposited: | 07 Mar 2023 16:13 |
Last Modified: | 16 May 2024 12:50 |
Status: | Published |
Publisher: | IEEE |
Identification Number: | 10.1109/IPDPS54959.2023.00046 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:197077 |