arrow
Return

JET: MULTILEVEL GRAPH PARTITIONING ON GRAPHICS PROCESSING UNITS

delete2024-10-16
delete0
delete
OA
AI
M
Michael S. Gilbert *
K
Kamesh Madduri
E
Erik G. Boman
R
Rajamanickam, Siva
DOI:10.1137/23M1559129delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The multilevel heuristic is the dominant strategy for high-quality sequential and parallel graph partitioning. Partition refinement is a key step of multilevel graph partitioning. In this work, we present Jet, a new parallel algorithm for partition refinement specifically 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.
Keywords:
graph partitioning
GPUs
multilevel
refinement

Journal

SIAM Journal on Scientific Computing cover
SIAM Journal on Scientific Computing
IF:
2.6
Papers:
5.1K
Citations:
1.8W

Organization

P
Pennsylvania State University
Scholars:
3.0W
Papers: 2.6W
Citations: 7.2W
P
pennsylvania commonwealth system of higher education (pcshe)
Scholars:
12.9W
Papers: 11.7W
Citations: 177