Task inefficiency patterns for a wave equation solver
arXiv:2105.12739 · doi:10.1007/978-3-030-85262-7_8
Abstract
The orchestration of complex algorithms demands high levels of automation to use modern hardware efficiently. Task-based programming with OpenMP 5.0 is a prominent candidate to accomplish this goal. We study OpenMP 5.0's tasking in the context of a wave equation solver (ExaHyPE) using three different architectures and runtimes. We describe several task-scheduling flaws present in currently available runtimes, demonstrate how they impact performance and show how to work around them. Finally, we propose extensions to the OpenMP standard.
References in corpus (5)
- A Survey of High Level Frameworks in Block-Structured Adaptive Mesh Refinement Packages
- ExaHyPE: An Engine for Parallel Dynamically Adaptive Simulations of Wave Problems
- SWIFT: Using task-based parallelism, fully asynchronous communication, and graph partition-based domain decomposition for strong scaling on more than 100,000 cores
- The Peano software - parallel, automaton-based, dynamically adaptive grid traversals
- Enclave Tasking for Discontinuous Galerkin Methods on Dynamically Adaptive Meshes