JET: MULTILEVEL GRAPH PARTITIONING ON GRAPHICS PROCESSING UNITS

Michael S. Gilbert, Kamesh Madduri, Erik G. Boman, Siva Rajamanickam

Research output: Contribution to journalArticlepeer-review

Abstract

The multilevel heuristic is the dominant strategy for high-quality sequential and parallel graph partitioning. Partition refnement is a key step of multilevel graph partitioning. In this work, we present Jet, a new parallel algorithm for partition refnement specifcally designed for graphics processing units (GPUs). We combine Jet with GPU-aware coarsening to develop a k-way graph partitioner, the Jet partitioner. The new partitioner achieves superior quality when compared to state-of-the-art shared memory partitioners on a large collection of test graphs.

Original languageEnglish (US)
Pages (from-to)B700-B724
JournalSIAM Journal on Scientific Computing
Volume46
Issue number5
DOIs
StatePublished - 2024

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'JET: MULTILEVEL GRAPH PARTITIONING ON GRAPHICS PROCESSING UNITS'. Together they form a unique fingerprint.

Cite this