Title: High-level strategies for parallel shared-memory sparse matrix–vector multiplication
Authors: Yzelman, Albert-Jan ×
Roose, Dirk #
Issue Date: Jan-2014
Publisher: Institute of Electrical and Electronics Engineers
Series Title: IEEE Transactions on Parallel and Distributed Systems vol:25 issue:1 pages:116-125
Abstract: The sparse matrix–vector multiplication is an important kernel, but is hard to efficiently execute even in the sequential case. The problems –namely low arithmetic intensity, inefficient cache use, and limited memory bandwidth– are magnified as the core count on shared-memory parallel architectures increases. Existing techniques
are discussed in detail, and categorised chiefly based on their distribution types. Based on this new parallelisation techniques are proposed. The theoretical scalability and memory usage of the various strategies are analysed, and experiments on multiple NUMA architectures confirm the validity of the results. One of the newly proposed methods attains the best average result in experiments, in one of the experiments obtaining a parallel efficiency of 90 percent.
Description: (preprint published online on IEEE website
ISSN: 1045-9219
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Numerical Analysis and Applied Mathematics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
TW614.pdfTechnical report TW614, Department of Computer Science, KU Leuven Submitted 311KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science