SC2025Top-tier venue
AMRaCut: Scalable Partitioning for Adaptive Mesh Refinement
Budvin Edippuliarachchi, David Van Komen, Hari Sundar
Abstract
Mesh partitioning is critical for scalable distributed PDE solvers. Traditional methods like spatial ordering and multi-level graph partitioning have significant tradeoffs between partition quality and parallel scalability. We present AMRaCut, a distributed-parallel mesh partitioner that bridges this gap using parallel label propagation and graph diffusion. It operates mostly locally on initial partitions, limiting inter-process communications to neighboring processes. This locality is especially effective in AMR, where mesh evolves dynamically with mostly local changes.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 873b2eae-5fd8-44eb-9df3-c9adae614d42Related papers
- Clustering-based Partitioning for Large Web GraphsDeyu Kong, Xike Xie, Zhuoxu ZhangICDE 2022 · 22 citations
- Optimizing Graph Partition by Optimal Vertex-Cut: A Holistic ApproachWenwen Qu, Weixi Zhang, Ji Cheng, Chaorui Zhang et al.ICDE 2023 · 8 citations
- Swarm Reinforcement Learning for Adaptive Mesh RefinementNiklas Freymuth, Philipp Dahlinger, Tobias Würth, Simon Reisch et al.NeurIPS 2023 · 28 citations
- Evaluation of a minimally synchronous algorithm for 2: 1 octree balanceHansol Suh, Tobin IsaacSC 2020 · 1 citation
- G-kway: Multilevel GPU-Accelerated k-way Graph PartitionerWan-Luan Lee, Dian-Lun Lin, Tsung-Wei Huang, Shui Jiang et al.DAC 2024 · 24 citations
