Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-03-04
Computer Science
Distributed, Parallel, and Cluster Computing
17 pages, 17 figures, reviewed related work section, fixed typos
Scientific paper
We consider the problem of developing an efficient multi-threaded implementation of the matrix-vector multiplication algorithm for sparse matrices with structural symmetry. Matrices are stored using the compressed sparse row-column format (CSRC), designed for profiting from the symmetric non-zero pattern observed in global finite element matrices. Unlike classical compressed storage formats, performing the sparse matrix-vector product using the CSRC requires thread-safe access to the destination vector. To avoid race conditions, we have implemented two partitioning strategies. In the first one, each thread allocates an array for storing its contributions, which are later combined in an accumulation step. We analyze how to perform this accumulation in four different ways. The second strategy employs a coloring algorithm for grouping rows that can be concurrently processed by threads. Our results indicate that, although incurring an increase in the working set size, the former approach leads to the best performance improvements for most matrices.
Ainsworth George O. Jr.
Batista Vicente H. F.
Ribeiro Fernando L. B.
No associations
LandOfFree
Parallel structurally-symmetric sparse matrix-vector products on multi-core processors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel structurally-symmetric sparse matrix-vector products on multi-core processors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel structurally-symmetric sparse matrix-vector products on multi-core processors will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-559321