A nested dissection approach to sparse matrix partitioning for parallel computations.
We consider how to distribute sparse matrices among processes to reduce communication costs in parallel sparse matrix computations, specifically, sparse matrix-vector multiplication. Our main contributions are: (i) an exact graph model for communication with general (two-dimensional) matrix distribution, and (ii) a recursive partitioning algorithm based on nested dissection (substructuring). We show that the communication volume is closely linked to vertex separators. We have implemented our algorithm using hypergraph partitioning software to enable a fair comparison with existing methods. We present numerical results for sparse matrices from several application areas, with up to 9 million nonzeros. The results show that our new approach is superior to traditional 1d partitioning and comparable to a current leading partitioning method, the finegrain hypergraph method, in terms of communication volume. Our nested dissection method has two advantages over the fine-grain method: it is faster to compute, and the resulting distribution requires fewer communication messages.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 947836
- Report Number(s):
- SAND2008-5482J; TRN: US200905%%199
- Journal Information:
- Proposed for publication in SIAM Journal on Scientific Computing., Journal Name: Proposed for publication in SIAM Journal on Scientific Computing.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Improved parallel data partitioning by nested dissection with applications to information retrieval.
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks