A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
2017
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
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
doi:10.1109/ipdps.2017.85
dblp:conf/ipps/AzadJBN17
fatcat:26th3xfycjbxlmkjafytrx5q54