On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
Citations Over TimeTop 10% of 2010 papers
Abstract
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.
Related Papers
- → Hypergraph Modeling(2023)1 cited
- → Online Binary Space Partitioning Forests(2020)1 cited
- → Analytical Partitioning: Improvement over FM(2017)
- → Non-uniform Hypergraphs(2020)
- On the random greedy F-free hypergraph process(2015)