General
Multilevel Graph Partitioning on GPU Supercomputers
arXiv cs.DC0 views
arXiv:2611.24264v1 Announce Type: new Abstract: Graph partitioning is a key enabler in computational science, with applications to sparse linear algebra, load-balanced parallel computation, and graph computations. In recent years, graphics processing units (GPUs) have become the preferred accelerator on the world's top supercomputers. Despite this, most existing distributed graph partitioners do not utilize GPUs. In this work, we develop a new multi-GPU distributed partitioner based on Jet, a prior single-GPU partitioner. We seek to optimize scalability without sacrificing quality. Our partitioner utilizes CUDA-aware MPI, one-sided communication routines, and an overall bulk-synchronous parallel structure. We demonstrate solution quality comparable to Jet. Our experiments show excellent weak scaling up to 256 GPUs, enabling partitioning of instances significantly larger than a single-GPU partitioner can handle.
Source:https://arxiv.org/abs/2611.24264PreviouseFAIR: Fair LLM Serving under Hourly Electricity CommitmentsNextScaleBench: An Extensible and Reproducible Experimental Platform for Kubernetes Autoscaling Research
Related posts
On the complexity of standard and waste-free SMC samplers
0arXiv stat.CO
A missed sprint goal or a declined pull request is not an indictment of your intelligence
0dev.to Career
Generative modeling of conditional probability distributions on the level-sets of collective variables
0arXiv stat.ML
Tired of Endless Subscriptions? Here’s How to Stream Your Favorite Movies for Free in HD
0dev.to WebDev
Show HN: Port.fm – Internet radio tuned by decade, energy, or location
0Hacker News Show
Show HN: Snowchive – Snowden archive of all published documents
0Hacker News Show