TL;DR
This paper presents a parallel semi-Lagrangian discontinuous Galerkin method implementation that demonstrates high scalability and efficiency on large distributed memory systems, suitable for solving hyperbolic PDEs in multiple dimensions.
Contribution
It introduces a dimension-independent C++ framework for semi-Lagrangian discontinuous Galerkin methods with scalable parallel performance on clusters.
Findings
Achieved over 0.89 parallel efficiency up to 8192 cores in weak scaling.
Demonstrated good strong scaling up to 1024 cores.
Validated the framework with a Vlasov--Poisson solver.
Abstract
The recently developed semi-Lagrangian discontinuous Galerkin approach is used to discretize hyperbolic partial differential equations (usually first order equations). Since these methods are conservative, local in space, and able to limit numerical diffusion, they are considered a promising alternative to more traditional semi-Lagrangian schemes (which are usually based on polynomial or spline interpolation). In this paper, we consider a parallel implementation of a semi-Lagrangian discontinuous Galerkin method for distributed memory systems (so-called clusters). Both strong and weak scaling studies are performed on the Vienna Scientific Cluster 2 (VSC-2). In the case of weak scaling, up to 8192 cores, we observe a parallel efficiency above 0.89 for both two and four dimensional problems. Strong scaling results show good scalability to at least 1024 cores (we consider problems that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
