2014
DOI: 10.1016/j.cageo.2013.10.004
|View full text |Cite
|
Sign up to set email alerts
|

Massively parallel regularized 3D inversion of potential fields on CPUs and GPUs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
20
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 54 publications
(22 citation statements)
references
References 28 publications
0
20
0
Order By: Relevance
“…For the size of forward problems that we aim to solve, the sensitivity matrix, with dimensions of the number of data points no times the number of 3D volume cells (nx+1)(ny+1)(nz +1) , is too large to keep in memory. The solution is to parallelize over the number of grid cells (nx+1)(ny+1)(nz +1) , i.e., a single row of the matrix G. This is especially important for the accelerators, which have limited memory capacity, e.g., 1023 MB onboard memory in a GTX 650Ti GPU, and high cost of data transfer between the host and the accelerator (Moorkamp et al, 2010;Čuma and Zhdanov, 2014). Figure 6 shows the core algorithm of this step using CUDA FORTRAN.…”
Section: Calculate the Sensitivity Matrix Gmentioning
confidence: 99%
See 3 more Smart Citations
“…For the size of forward problems that we aim to solve, the sensitivity matrix, with dimensions of the number of data points no times the number of 3D volume cells (nx+1)(ny+1)(nz +1) , is too large to keep in memory. The solution is to parallelize over the number of grid cells (nx+1)(ny+1)(nz +1) , i.e., a single row of the matrix G. This is especially important for the accelerators, which have limited memory capacity, e.g., 1023 MB onboard memory in a GTX 650Ti GPU, and high cost of data transfer between the host and the accelerator (Moorkamp et al, 2010;Čuma and Zhdanov, 2014). Figure 6 shows the core algorithm of this step using CUDA FORTRAN.…”
Section: Calculate the Sensitivity Matrix Gmentioning
confidence: 99%
“…When the inversion extends from 2D to 3D, it is in general very computationally demanding, and parallel computational resources or even supercomputers are often used to obtain a result (Yao et al, 2003;Moorkamp et al, 2010;Čuma and Zhdanov, 2014;Chen et al, 2012a and2012b).…”
Section: Introductionmentioning
confidence: 97%
See 2 more Smart Citations
“…However, the efficiency of inversion method can also restrict the development of the potential field. Over the last decade, most of the computer acceleration technology has been achieved and applied by hardware parallelization according to the more and more processor cores into the Central Processing Unit (CPU) and Graphics Processing Units (CPUs) (Chen et al, 2012;Čuma and Zhdanov, 2014). These inversion methods can obviously enhance the inversion efficiency by the hardware parallelization.…”
Section: Introductionmentioning
confidence: 99%