2015
DOI: 10.1093/gji/ggv380
|View full text |Cite
|
Sign up to set email alerts
|

A nodal discontinuous Galerkin method for reverse-time migration on GPU clusters

Abstract: Improving both accuracy and computational performance of numerical tools is a major challenge for seismic imaging and generally requires specialized implementations to make full use of modern parallel architectures. We present a computational strategy for reverse-time migration (RTM) with acceleratoraided clusters. A new imaging condition computed from the pressure and velocity fields is introduced. The model solver is based on a high-order discontinuous Galerkin time-domain (DGTD) method for the pressure-velo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
36
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
7

Relationship

5
2

Authors

Journals

citations
Cited by 28 publications
(36 citation statements)
references
References 64 publications
0
36
0
Order By: Relevance
“…Additionally, the computational structure of DG methods has been shown to be well-suited to many-core and accelerator architectures such as Graphics Processing Units (GPU). DG implementations on a single GPU have demonstrated significant speedups over conventional architectures [12,13], while implementations using multiple GPUs still demonstrate high scalability [14,15].…”
mentioning
confidence: 99%
“…Additionally, the computational structure of DG methods has been shown to be well-suited to many-core and accelerator architectures such as Graphics Processing Units (GPU). DG implementations on a single GPU have demonstrated significant speedups over conventional architectures [12,13], while implementations using multiple GPUs still demonstrate high scalability [14,15].…”
mentioning
confidence: 99%
“…These methods can provide accurate solutions to realistic transient wave‐like problems thanks to heterogeneous, nonconforming and curvilinear meshes, high‐order discontinuous basis functions, and stable formulations for complicated physical models (see, eg, these studies). In addition, the discrete structure of the numerical schemes is well suited for efficient massively parallel computing on distributed memory architectures and modern many‐core accelerators …”
Section: Introductionmentioning
confidence: 99%
“…In addition, the discrete structure of the numerical schemes is well suited for efficient massively parallel computing on distributed memory architectures and modern many-core accelerators. [11][12][13][14][15][16] A critical issue for the simulation of wave phenomena is to correctly account for radiation of waves at artificial boundaries of the computational domain. Nonreflective boundary treatments must be incorporated into the discontinuous Galerkin formulations to simulate the outward propagation of signals and perturbations generated from within the computational domain, even if they are not a priori known.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Klöckner et al addressed this nontrivial cost by developing an implementation of DG on Graphics Processing Units (GPUs) in [3], where the structure of time-explicit DG was found to map extremely well to the coarse and fine grained parallelism present in accelerator architectures. Large problem sizes can be accomodated by parallelizing over multiple GPUs, which has been shown to yield scalable and efficient solvers [4,5].…”
mentioning
confidence: 99%