Skip to main content

Research Repository

Advanced Search

Enclave Tasking for DG Methods on Dynamically Adaptive Meshes

Charrier, Dominic E.; Hazelwood, Benjamin; Weinzierl, Tobias

Enclave Tasking for DG Methods on Dynamically Adaptive Meshes Thumbnail


Authors

Dominic E. Charrier

Benjamin Hazelwood



Abstract

High-order discontinuous Galerkin (DG) methods promise to be an excellent discretization paradigm for hyperbolic differential equation solvers running on supercomputers, since they combine high arithmetic intensity with localized data access, since they straightforwardly translate into nonoverlapping domain decomposition, and since they facilitate dynamic adaptivity without the need for conformal meshes. An efficient parallel evaluation of DG weak formulation in an MPI+X setting, however, remains nontrivial as dependency graphs over dynamically adaptive meshes change with each mesh refinement or coarsening, as resolution transitions yield nontrivial data flow dependencies, and as data sent along domain boundaries through message passing (MPI) have to be triggered in the correct order. Domain decomposition with MPI alone starts to become insufficient if the mesh changes very frequently, if mesh changes cannot be predicted, and if limiters and nonlinear per-cell solves yield unpredictable costs per cell. We introduce enclave tasking as a task invocation technique for shared memory and MPI+X: It does not assemble any task graph; instead the mesh traversal spawns ready tasks directly. A marker-and-cell approach ensures that tasks feeding into MPI or triggering mesh modifications as well as latency-sensitive or bandwidth-demanding tasks are processed with high priority. The remaining cell tasks form enclaves, i.e., groups of tasks that can be processed in the background. Enclave tasking introduces high concurrency which is homogeneously distributed over the mesh traversal, it mixes memory-intensive volumetric DG calculations with compute-bound Riemann solves, and it helps to overlap communication with computations. Our work focuses on ADER-DG and patch-based finite volumes. Yet, we discuss how the paradigm can be generalized to the whole DG family and finite volume stand-alone solvers.

Citation

Charrier, D. E., Hazelwood, B., & Weinzierl, T. (2020). Enclave Tasking for DG Methods on Dynamically Adaptive Meshes. SIAM Journal on Scientific Computing, 42(3), C69-C96. https://doi.org/10.1137/19m1276194

Journal Article Type Article
Acceptance Date Feb 26, 2020
Online Publication Date May 5, 2020
Publication Date 2020
Deposit Date Feb 26, 2020
Publicly Available Date May 15, 2020
Journal SIAM Journal on Scientific Computing
Print ISSN 1064-8275
Electronic ISSN 1095-7197
Publisher Society for Industrial and Applied Mathematics
Peer Reviewed Peer Reviewed
Volume 42
Issue 3
Pages C69-C96
DOI https://doi.org/10.1137/19m1276194
Related Public URLs https://arxiv.org/abs/1806.07984

Files

Published Journal Article (2.2 Mb)
PDF

Copyright Statement
© 2020 Society for Industrial and Applied Mathematics.





You might also like



Downloadable Citations