SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Scientific Computing / Volume 32 / Issue 2

SIAM J. Sci. Comput. 32, pp. 656-683 (28 pages)

On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe

Ümi̇t V. Çatalyürek, Cevdet Aykanat, and Bora Uçar

Full Text: Download PDF | Buy PDF (US$25) | View Cart
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, each having unique advantages. The first one treats the nonzeros of the matrix individually and hence produces fine-grain partitions. The other two produce coarser partitions, where one of them imposes a limit on the number of messages sent and received by a single processor, and the other trades that limit for a lower communication volume. We also present a thorough experimental evaluation of the proposed two-dimensional partitioning methods together with the hypergraph-based one-dimensional partitioning methods, using an extensive set of public domain matrices. Furthermore, for the users of these partitioning methods, we present a partitioning recipe that chooses one of the partitioning methods according to some matrix characteristics.

© 2010 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

05C50, 05C65, 65F10, 65F50, 65Y05

PUBLICATION DATA

ISSN

1064-8275 (print)  
1095-7197 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received October 10, 2008
Accepted October 21, 2009
Published online February 24, 2010
Digital Object Identifier
http://dx.doi.org/10.1137/080737770

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
  2. Adaptive Techniques for Improving the Performance of Incomplete Factorization Preconditioning
  3. Iterative Solvers for the Stochastic Finite Element Method
  4. An Inner-Outer Iteration for Computing PageRank
  5. Adaptive Time-Stepping for Incompressible Flow Part II: Navier–Stokes Equations
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close