The Reverse Cuthill-McKee Algorithm in Distributed-Memory
Ordering vertices of a graph is key to minimize fill-in and data structure size in sparse direct solvers, maximize locality in iterative solvers, and improve performance in graph algorithms. Except for naturally parallelizable ordering methods such as nested dissection, many important ordering methods have not been efficiently mapped to distributed-memory architectures. In this paper, we present the first-ever distributed-memory implementation of the reverse Cuthill-McKee (RCM) algorithm for reducing the profile of a sparse matrix. Our parallelization uses a two-dimensional sparse matrix decomposition. We achieve high performance by decomposing the problem into a small number of primitives and utilizing optimized implementations of these primitives. Our implementation shows strong scaling up to 1024 cores for smaller matrices and up to 4096 cores for larger matrices.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
- DOE Contract Number:
- AC02-05CH11231
- OSTI ID:
- 1439186
- Country of Publication:
- United States
- Language:
- English
Similar Records
A spectral algorithm for envelope reduction of sparse matrices
A nested dissection approach to sparse matrix partitioning for parallel computations.
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:46245
A nested dissection approach to sparse matrix partitioning for parallel computations.
Journal Article
·
Fri Aug 01 00:00:00 EDT 2008
· Proposed for publication in SIAM Journal on Scientific Computing.
·
OSTI ID:947836
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm
Journal Article
·
Sun Jul 02 20:00:00 EDT 2017
· Proceedings - IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
OSTI ID:1525227