Simulación de Redes Porosas via Algoritmos de Monte Carlo en GPUs (Pore Network Simulation via Monte Carlo Algorithms on GPUs)

Jorge Matadamas (, Graciela Román (, Fernando Rojas (, Miguel Castro (, Salomón Cordero (, Manuel Aguilar (

Universidad Autónoma Metropolitana
This paper appears in: Revista IEEE América Latina

Publication Date: May 2014
Volume: 12,   Issue: 3 
ISSN: 1548-0992

Sequential Monte Carlo simulation of pore networks, according to the Dual Site-Bond Model (DSBM) has been used successfully in the study of the structure and properties of porous media; these studies have a variety of applications (e.g. enhanced oil recovery, expedient gas storage, faster catalytic reactions, etc.) In the simplest form of DSBM, each pore is classified as a site or as a bond; the sites are modeled as hollow spheres and the bonds like hollow cylinders; each bond interconnects two sites providing the fulfillment of the construction principle (CP), which indicates that the size of a bond should always be smaller or at most equal to the sizes of each one of its two interconnected sites. The complexity of the simulation lies on making all pores of a 3D network to respect the CP. Previous work includes pore network simulation performed through a Monte Carlo parallel algorithm, by using a multi-core node cluster with C+MPI. Since the graphic processing unit (GPU) architecture is now an efficient alternative to parallel computing, in this work we propose three parallel Monte Carlo algorithms for pore network simulation employing CUDA and CUDA+MPI. First we propose two different data partitioning using a GPU, planes-CUDA and cubes-CUDA. Then, we propose a version of planes-CUDA that uses three interconnected GPUs. Our results show that the cubes-CUDA algorithm using a GPU attains better performance than the others.

Index Terms:
Pore network simulation, GPU cluster, Parallel Monte Carlo Method, CUDA, MPI   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (675)]