Jet: multilevel graph partitioning on graphics processing units

DOI10.1137/23m1559129MaRDI QIDQ6623690

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

Publication date: 24 October 2024

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

graph partitioningrefinementGPUs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic multigrid theory: The symmetric case
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• FROSch: a fast and robust overlapping Schwarz domain decomposition preconditioner based on Xpetra in Trilinos
• Advanced Coarsening Schemes for Graph Partitioning
• The university of Florida sparse matrix collection
• Engineering Multilevel Graph Partitioning Algorithms
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Drawing Huge Graphs by Algebraic Multigrid Optimization
• Algebraic multigrid methods
• Parallel Scientific Computation
• Algorithm 1003
• Scalable Shared-Memory Hypergraph Partitioning
• Fast <it>k</it>-selection algorithms for graphics processing units
• Deep multilevel graph partitioning
• Visualizing large graphs

This page was built for publication: Jet: multilevel graph partitioning on graphics processing units