A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids

DOI10.1016/j.jpdc.2006.11.003zbMath1115.68020OpenAlexW2054729225MaRDI QIDQ878683

William F. Mitchell

Publication date: 26 April 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.11.003

zbMATH Keywords

space filling curvesdynamic load balancingadaptive refinementgrid partitioningmultilevel adaptive methodparallel finite elementsrefinement tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Coarse Mesh Partitioning for Tree-Based AMR ⋮ A framework for high-fidelity particle tracking on massively parallel systems ⋮ Nonconforming Mesh Refinement for High-Order Finite Elements ⋮ Partitioned Simulation of Fluid-Structure Interaction on Cartesian Grids ⋮ Efficient \(O(N)\) integration for all-electron electronic structure calculation using numeric basis functions

Uses Software

• ParMETIS
• PHAML

This page was built for publication: A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids