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

Abstract 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.

[1]  Robert M. Farber,et al.  CUDA Application Design and Development , 2011 .

[2]  Alexandre Boucher,et al.  Applied Geostatistics with SGeMS: A User's Guide , 2009 .

[3]  Philippe Renard,et al.  Parallel Multiple-Point Statistics Algorithm Based on List and Tree Structures , 2013, Mathematical Geosciences.

[4]  Jason Sanders,et al.  CUDA by example: an introduction to general purpose GPU programming , 2010 .

[5]  Peter S. Pacheco Parallel programming with MPI , 1996 .

[6]  Sebastien Strebelle,et al.  Conditional Simulation of Complex Geological Structures Using Multiple-Point Statistics , 2002 .

[7]  Yuhong Liu,et al.  Improving Sequential Simulation with a Structured Path Guided by Information Content , 2004 .

[8]  Tikara Hosino,et al.  Multi‐GPU algorithm for k‐nearest neighbor problem , 2012, Concurr. Comput. Pract. Exp..

[9]  Philippe Renard,et al.  A practical guide to performing multiple-point statistical simulations with the Direct Sampling algorithm , 2013, Comput. Geosci..

[10]  Paul Switzer,et al.  Filter-Based Classification of Training Image Patterns for Spatial Simulation , 2006 .

[11]  Alexandre Boucher,et al.  A SGeMS code for pattern simulation of continuous and categorical variables: FILTERSIM , 2008, Comput. Geosci..

[12]  Philippe Renard,et al.  Guidelines to Perform Multiple-Point Statistical Simulations with the Direct Sampling Algorithm , 2012 .

[13]  Clayton V. Deutsch,et al.  GSLIB: Geostatistical Software Library and User's Guide , 1993 .

[14]  Thomas Tran,et al.  Improving variogram reproduction on dense simulation grids , 1994 .

[15]  G. Mariéthoz,et al.  An Improved Parallel Multiple-point Algorithm Using a List Approach , 2011 .

[16]  Colin Daly,et al.  Higher Order Models using Entropy, Markov Random Fields and Sequential Simulation , 2005 .

[17]  Andre G. Journel Beyond Covariance: The Advent of Multiple-Point Geostatistics , 2005 .

[18]  Jef Caers,et al.  Sequential simulation with patterns , 2005 .

[19]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[20]  Yuhong Liu,et al.  An Information Content Measure Using Multiple-point Statistics , 2005 .

[21]  Michael Garland,et al.  Designing efficient sorting algorithms for manycore GPUs , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[22]  Gregoire Mariethoz,et al.  Geological stochastic imaging for aquifer characterization , 2009 .

[23]  T. Mukerji Exploring Direct Sampling and Iterative Spatial Resampling in History Matching , 2010 .

[24]  Hugo Caetano,et al.  A New Parallelization Approach for Sequential Simulation , 2008 .

[25]  R. M. Srivastava,et al.  Multivariate Geostatistics: Beyond Bivariate Moments , 1993 .

[26]  Jef Caers,et al.  G s TL: the geostatistical template library in C++ , 2002 .

[27]  Grégoire Mariethoz,et al.  A general parallelization strategy for random path based geostatistical simulation methods , 2010, Comput. Geosci..

[28]  L. Dagum,et al.  OpenMP: an industry standard API for shared-memory programming , 1998 .

[29]  Claude E. Shannon,et al.  A mathematical theory of communication , 1948, MOCO.

[30]  Regina Berretta,et al.  GPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs , 2012, PloS one.

[31]  G. Mariéthoz,et al.  Reconstruction of Incomplete Data Sets or Images Using Direct Sampling , 2010 .

[32]  A. Journel,et al.  Fast FILTERSIM Simulation with Score-based Distance , 2008 .

[33]  Gregoire Mariethoz,et al.  The Direct Sampling method to perform multiple‐point geostatistical simulations , 2010 .