2015
DOI: 10.4208/cicp.070114.271114a
|View full text |Cite
|
Sign up to set email alerts
|

GPU Accelerated Discontinuous Galerkin Methods for Shallow Water Equations

Abstract: We discuss the development, verification, and performance of a GPU accelerated discontinuous Galerkin method for the solutions of two dimensional nonlinear shallow water equations. The shallow water equations are hyperbolic partial differential equations and are widely used in the simulation of tsunami wave propagations. Our algorithms are tailored to take advantage of the single instruction multiple data (SIMD) architecture of graphic processing units. The time integration is accelerated by local time steppin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(35 citation statements)
references
References 24 publications
0
34
0
1
Order By: Relevance
“…Restriction of the global residual r N starts by scaling it by the inverted mass matrix to form y N = r N /m N and to use (6) to form the local vector y ijk;e . Then, y ijk;e is used to form the local coarse residual (see (9)):…”
Section: Coarse Grid Preconditionermentioning
confidence: 99%
“…Restriction of the global residual r N starts by scaling it by the inverted mass matrix to form y N = r N /m N and to use (6) to form the local vector y ijk;e . Then, y ijk;e is used to form the local coarse residual (see (9)):…”
Section: Coarse Grid Preconditionermentioning
confidence: 99%
“…In this section, we compare the computational cost of hexahedra, wedges, and pyramids relative to the computational cost of tetrahedra. The results reported are for tuned computational kernels, where the number of elements processed per workgroup has been chosen in order to minimize the runtimes of the volume, surface, and update kernels for each element [34,17]. As suggested in [26], automation of this process is crucial for portable performance across various architectures, especially for hybrid meshes where parameters must be tuned for 12 separate kernels.…”
Section: Cost Per Element Typementioning
confidence: 99%
“…Since the details of the implementation are independent of element type, we refer the reader to [21,17,34] for a description of the multi-rate scheme on triangular and tetrahedral meshes.…”
mentioning
confidence: 99%
“…The local element-to-element coupling and the dense algebraic operations required per element make nodal DG methods suitable for parallel multi-threading computations, especially with GPUs. This implementation has successfully been adapted for several applications [Fuhry et al, 2014, Gandham et al, 2015, Godel et al, 2010, Modave et al, 2015.…”
Section: Introductionmentioning
confidence: 99%