Enclave Tasking for DG Methods on Dynamically Adaptive Meshes
From MaRDI portal
Abstract: High-order Discontinuous Galerkin (DG) methods promise to be an excellent discretisation paradigm for partial differential equation solvers by combining high arithmetic intensity with localised data access. They also facilitate dynamic adaptivity without the need for conformal meshes. A parallel evaluation of DG's weak formulation within a mesh traversal is non-trivial, as dependency graphs over dynamically adaptive meshes change, as causal constraints along resolution transitions have to be preserved, and as data sends along MPI domain boundaries have to be triggered in the correct order. We propose to process mesh elements subject to constraints with high priority or, where needed, serially throughout a traversal. The remaining cells form enclaves and are spawned into a task system. This introduces concurrency, mixes memory-intensive DG integrations with compute-bound Riemann solves, and overlaps computation and communication. We discuss implications on MPI and show that MPI parallelisation improves by a factor of three through enclave tasking, while we obtain an additional factor of two from shared memory if grids are dynamically adaptive.
Recommendations
Cites work
- scientific article; zbMATH DE number 1218967 (Why is no real title available?)
- A simple diffuse interface approach on adaptive Cartesian grids for the linear elastic wave equations with complex topography
- Adaptive Mesh Refinement Using Wave-Propagation Algorithms for Hyperbolic Systems
- Algorithms and data structures for massively parallel generic adaptive finite element codes
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- Efficient implementation of ADER discontinuous Galerkin schemes for a scalable hyperbolic PDE engine
- ExaHyPE: an engine for parallel dynamically adaptive simulations of wave problems
- Explicit discontinuous Galerkin methods for unsteady problems
- Finite Volume Methods for Hyperbolic Problems
- High-order finite-element seismic wave propagation modeling with MPI on a large GPU cluster
- Local adaptive mesh refinement for shock hydrodynamics
- Nodal discontinuous Galerkin methods on graphics processors
- Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
- Quasi-matrix-free hybrid multigrid on dynamically adaptive Cartesian grids
- Recursive algorithms for distributed forests of octrees
- The Peano software -- parallel, automaton-based, dynamically adaptive grid traversals
- Tsunami modelling with adaptively refined finite volume methods
- \textit{A posteriori} subcell limiting of the discontinuous Galerkin finite element method for hyperbolic conservation laws
Cited in
(4)- Space-time adaptive ADER-DG finite element method with LST-DG predictor and \textit{a posteriori} sub-cell ADER-WENO finite-volume limiting for multidimensional detonation waves simulation
- Space-time adaptive ADER-DG finite element method with LST-DG predictor and a posteriori sub-cell WENO finite-volume limiting for simulation of non-stationary compressible multicomponent reactive flows
- The effective use of BLAS interface for implementation of finite-element ADER-DG and finite-volume ADER-WENO methods
- ExaGRyPE: numerical general relativity solvers based upon the hyperbolic PDEs solver engine ExaHyPE
This page was built for publication: Enclave Tasking for DG Methods on Dynamically Adaptive Meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112559)
