GPU-accelerated Direct Sampling method for multiple-point statistical simulation

被引:32
作者
Huang, Tao [1 ]
Li, Xue [1 ]
Zhang, Ting [1 ,2 ]
Lu, De-Tang [1 ]
机构
[1] Univ Sci & Technol China, Dept Modern Mech, Hefei 230027, Peoples R China
[2] Shanghai Univ Elect Power, Sch Comp & Informat Engn, Shanghai 200090, Peoples R China
关键词
Graphics processing units (GPU); Geostatistical simulation; Direct Sampling; Parallelization Compute unified device architecture (CUDA);
D O I
10.1016/j.cageo.2013.03.020
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Geostatistical simulation techniques have become a widely used tool for the modeling of oil and gas reservoirs and the assessment of uncertainty. The Direct Sampling (DS) algorithm is a recent multiple-point statistical simulation technique. It directly samples the training image (TI) during the simulation process by calculating distances between the TI patterns and the given data events found in the simulation grid (SG). Omitting the prior storage of all the TI patterns in a database, the DS algorithm can be used to simulate categorical, continuous and multivariate variables. Three fundamental input parameters are required for the definition of DS applications: the number of neighbors n, the acceptance threshold t and the fraction of the TI to scan f. For very large grids and complex spatial models with more severe parameter restrictions, the computational costs in terms of simulation time often become the bottleneck of practical applications. This paper focuses on an innovative implementation of the Direct Sampling method which exploits the benefits of graphics processing units (GPUs) to improve computational performance. Parallel schemes are applied to deal with two of the DS input parameters, n and f. Performance tests are carried out with large 3D grid size and the results are compared with those obtained based on the simulations with central processing units (CPU). The comparison indicates that the use of GPUs reduces the computation time by a factor of 10X-100X depending on the input parameters. Moreover, the concept of the search ellipsoid can be conveniently combined with the flexible data template of the DS method, and our experimental results of sand channels reconstruction show that it can improve the reproduction of the long-range connectivity patterns. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:13 / 23
页数:11
相关论文
共 39 条
[1]  
[Anonymous], 2009, THESIS
[2]  
[Anonymous], 1997, Parallel programming with MPI
[3]  
[Anonymous], 2011, CUDA by Example: An Introduction to General-Purpose GPU Programming
[4]  
[Anonymous], TECHNICAL REPORT
[5]  
[Anonymous], 2000, SEQUENTIAL SIMULATIO
[6]   GPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs [J].
Arefin, Ahmed Shamsul ;
Riveros, Carlos ;
Berretta, Regina ;
Moscato, Pablo .
PLOS ONE, 2012, 7 (08)
[7]  
Arpat GB, 2005, THESIS
[8]   OpenMP: An industry standard API for shared-memory programming [J].
Dagum, L ;
Menon, R .
IEEE COMPUTATIONAL SCIENCE & ENGINEERING, 1998, 5 (01) :46-55
[9]  
Daly C, 2005, QUANT GEO G, V14, P215
[10]  
Deutsch C. V., 1992, APPL GEOSTATISTICS S