Coarse mesh partitioning for tree-based AMR
From MaRDI portal
Abstract: In tree based adaptive mesh refinement, elements are partitioned between processes using a space filling curve. The curve establishes an ordering between all elements that derive from the same root element, the tree. When representing more complex geometries by patching together several trees, the roots of these trees form an unstructured coarse mesh. We present an algorithm to partition the elements of the coarse mesh such that (a) the fine mesh can be load-balanced to equal element counts per process regardless of the element-to-tree map and (b) each process that holds fine mesh elements has access to the meta data of all relevant trees. As an additional feature, the algorithm partitions the meta data of relevant ghost (halo) trees as well. We develop in detail how each process computes the communication pattern for the partition routine without handshaking and with minimal data movement. We demonstrate the scalability of this approach on up to 917e3 MPI ranks and .37e12 coarse mesh elements, measuring run times of one second or less.
Recommendations
- scientific article; zbMATH DE number 833721
- A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
- p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees
- Parallel tree algorithms for AMR and non-standard data access
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming
Cites work
- A‐posteriori error estimates for the finite element method
- A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
- A tetrahedral space-filling curve for nonconforming adaptive meshes
- Adaptive grid refinement for numerical wather prediction
- Adaptive mesh refinement for hyperbolic partial differential equations
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Controlling Unstructured Mesh Partitions for Massively Parallel Simulations
- deal.II—A general-purpose object-oriented finite element library
- Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
- Fast optimal load balancing algorithms for 1D partitioning
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- scientific article; zbMATH DE number 2234771 (Why is no real title available?)
- Local adaptive mesh refinement for shock hydrodynamics
- On a Data Structure for Adaptive Finite Element Mesh Refinements
- p4est: scalable algorithms for parallel adaptive mesh refinement on forests of octrees
- Parallel level-set methods on adaptive tree-based grids
- Parallel Memory-Efficient Adaptive Mesh Refinement on Structured Triangular Meshes with Billions of Grid Cells
- Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
- Parallel unstructured mesh generation by an advancing front method
- Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
- PUMI: parallel unstructured mesh infrastructure
- Recursive algorithms for distributed forests of octrees
- Space-Filling Curves
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: Coarse mesh partitioning for tree-based AMR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594181)
