Sphynx: a parallel multi-GPU graph partitioner for distributed-memory systems
Seher Acer, Erik G Boman, Christian A Glusa, and Sivasankaran, Rajamanickam

TL;DR
Sphynx is a novel parallel multi-GPU graph partitioner designed for distributed-memory systems, offering high performance and quality, especially on irregular graphs, by leveraging spectral methods and the Trilinos framework.
Contribution
This paper introduces Sphynx, the first distributed-memory parallel multi-GPU spectral graph partitioner, with systematic evaluation of algorithmic choices and performance on diverse graph types.
Findings
Sphynx is the fastest on irregular graphs on Summit supercomputer.
It achieves partitioning quality close to ParMETIS on regular graphs.
Sphynx outperforms nvGRAPH in speed, balance, and quality on a single GPU.
Abstract
Graph partitioning has been an important tool to partition the work among several processors to minimize the communication cost and balance the workload. While accelerator-based supercomputers are emerging to be the standard, the use of graph partitioning becomes even more important as applications are rapidly moving to these architectures. However, there is no distributed-memory parallel, multi-GPU graph partitioner available for applications. We developed a spectral graph partitioner, Sphynx, using the portable, accelerator-friendly stack of the Trilinos framework. In Sphynx, we allow using different preconditioners and exploit their unique advantages. We use Sphynx to systematically evaluate the various algorithmic choices in spectral partitioning with a focus on the GPU performance. We perform those evaluations on two distinct classes of graphs: regular (such as meshes, matrices…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Graph Theory and Algorithms · Network Packet Processing and Optimization
