Pith. sign in

REVIEW 1 cited by

Jet: Multilevel Graph Partitioning on Graphics Processing Units

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.13194 v2 pith:IPB25GFW submitted 2023-04-25 cs.DC cs.DM

Michael S. Gilbert , Kamesh Madduri , Erik G. Boman , Sivasankaran Rajamanickam This is my paper · ORCID
classification cs.DCcs.DM
keywords graphmultilevelpartitionerpartitioninggraphicsparallelpartitionprocessing
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

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 compared to state-of-the-art shared memory partitioners on a large collection of test graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deterministic Parallel High-Quality Hypergraph Partitioning

    cs.DC 2025-04 conditional novelty 7.0 of 10

    DetJet and DetFlows are the first deterministic parallel hypergraph partitioners whose quality matches or beats non-deterministic state-of-the-art solvers, at a modest time cost.

Pith tools