Spark98: Sparse matrix kernels for shared memory and message passing systems (1997)
Cached
Download Links
| Citations: | 28 - 1 self |
BibTeX
@TECHREPORT{O’hallaron97spark98:sparse,
author = {David R. O’hallaron},
title = {Spark98: Sparse matrix kernels for shared memory and message passing systems},
institution = {},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Spark98 is a collection of sparse matrix kernels for shared memory and message passing systems. Our aim is to provide system builders with a set of example sparse matrix codes that are simple, realistic, and portable. Each kernel performs a sequence of sparse matrix vector product operations using matrices that are derived from a family of three-dimensional finite element earthquake applications. We describe the computational structure of the kernels, summarize their performance on a parallel system, and discuss some of the insights that such kernels can provide. In particular we notice that efficient parallel programming of sparse codes requires careful partitioning of data references, regardless of the underlying memory system. So on one hand, efficient shared memory programs can be just as difficult to write as efficient message passing programs. On the other hand, shared memory programs are not necessarily less
