Title: Sparse matrix--vector multiplication: parallelization and vectorization
Authors: Yzelman, Albert-Jan
Roose, Dirk
Meerbergen, Karl
Issue Date: 2014
Publisher: Elsevier
Host Document: High Performance Parallelism Pearls edition:1st pages:1-20
Article number: 27
Abstract: Sparse computations are ubiquitous in computational codes, with the sparse matrix-vector (SpMV) multiplication as an important computational kernel in software for simulation (e.g., computational fluid dynamics, structural analysis), optimization (e.g., economics, transport scheduling), data analysis (e.g., drug testing, social networks), and so on.
A sparse matrix is characterized by having most of its elements equal to zero. To take advantage of the sparsity, such matrices are stored in specifically designed data structures so that meaningless multiplications with zeroes can be avoided.
Current hardware trends lead to an increasing width of vector units as well as to decreasing effective bandwidth-per-core. For sparse computations, these two trends conflict. In this chapter, we consider sparse matrix computations on multicore architectures with vector processing capabilities, and design a usable and efficient data structure for vectorized sparse computations.
ISBN: 978-01-280-2118-7
Publication status: published
KU Leuven publication type: IHb-p
Appears in Collections:Numerical Analysis and Applied Mathematics Section

Files in This Item:

There are no files associated with this item.

Request a copy


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