Parallel Scaling of the Regionally-Implicit Discontinuous Galerkin Method with Quasi-Quadrature-Free Matrix Assembly

01/04/2021
by   Pierson T. Guthrey, et al.
0

In this work we investigate the parallel scalability of the numerical method developed in Guthrey and Rossmanith [The regionally implicit discontinuous Galerkin method: Improving the stability of DG-FEM, SIAM J. Numer. Anal. (2019)]. We develop an implementation of the regionally-implicit discontinuous Galerkin (RIDG) method in DoGPack, which is an open source C++ software package for discontinuous Galerkin methods. Specifically, we develop and test a hybrid OpenMP and MPI parallelized implementation of DoGPack with the goal of exploring the efficiency and scalability of RIDG in comparison to the popular strong stability-preserving Runge-Kutta discontinuous Galerkin (SSP-RKDG) method. We demonstrate that RIDG methods are able to hide communication latency associated with distributed memory parallelism, due to the fact that almost all of the work involved in the method is highly localized to each element, producing a localized prediction for each region. We demonstrate the enhanced efficiency and scalability of the of the RIDG method and compare it to SSP-RKDG methods and show extensibility to very high order schemes. The two-dimensional scaling study is performed on machines at the Institute for Cyber-Enabled Research at Michigan State University, using up to 1440 total cores on Intel(R) Xeon(R) Gold 6148 CPU @ 2.40GHz CPUs. The three dimensional scaling study is performed on Livermore Computing clusters at at Lawrence Livermore National Laboratory, using up to 28672 total cores on Intel Xeon CLX-8276L CPUs with Omni-Path interconnects.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/12/2018

Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations

This work presents and compares efficient implementations of high-order ...
06/28/2020

GPU-Accelerated Discontinuous Galerkin Methods: 30x Speedup on 345 Billion Unknowns

A discontinuous Galerkin method for the discretization of the compressib...
11/29/2017

High-performance Implementation of Matrix-free High-order Discontinuous Galerkin Methods

Achieving a substantial part of peak performance on todays and future hi...
07/23/2020

Linearizing the hybridizable discontinuous Galerkin method: A linearly scaling operator

This paper proposes a matrix-free residual evaluation technique for the ...
07/09/2020

GPU-accelerated discontinuous Galerkin methods on polytopic meshes

Discontinuous Galerkin (dG) methods on meshes consisting of polygonal/po...
01/03/2021

A comparison of matrix-free isogeometric Galerkin and collocation methods for Karhunen–Loève expansion

Numerical computation of the Karhunen–Loève expansion is computationally...
03/06/2018

A comparison of semi-Lagrangian discontinuous Galerkin and spline based Vlasov solvers in four dimensions

The purpose of the present paper is to compare two semi-Lagrangian metho...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.