Large-scale Reservoir Simulations on IBM Blue Gene/Q

This paper presents our work on simulation of large-scale reservoir models on IBM Blue Gene/Q and studying the scalability of our parallel reservoir simulators. An in-house black oil simulator has been implemented. It uses MPI for communication and is capable of simulating reservoir models with hundreds of millions of grid cells. Benchmarks show that our parallel simulator are thousands of times faster than sequential simulators that designed for workstations and personal computers, and the simulator has excellent scalability

Three-Dimensional Parallel Finite Element Simulation of Natural Gas Flow in a Porous Media.

A parallel-three-dimensional finite element simulation of natural gas flow in a porous media was developed for use in multiple well reservoirs. Developed with this simulation was a set of graphical applications to provide a geometric description of the reservoir, viewing of the generated mesh and viewing of results generated by the simulation. An adaptive mesh scheme for the dynamic refinement and derefinement of the mesh during the solution process is presented. The adaptive mesh scheme utilizes a mesh storage technique designed to reduce the space requirements of the mesh. This adaptive mesh technique was applied to an unstructured mesh. A parallel algorithm for the frontal solution technique was developed and implemented in C++ on small clusters of Microsoft Windows NT 4.0, Linux, and PowerPC workstations using MPI. The increased accuracy of these simulations was verified for the Eugene Island natural gas reservoir, located off the coast of Louisiana. The results for the Eugene Island example are more accurate than results from previous finite difference solutions for the same simulation

A locally adaptive time-stepping algorithm for\ud petroleum reservoir simulations

An algorithm for locally adapting the step-size for large scale finite volume simulations of multi-phase flow in petroleum reservoirs is suggested which allows for an “all-in-one” implicit calculation of behaviour over a very large time scale. Some numerical results for simple two-phase flow in one space dimension illustrate the promise of the algorithm, which has also been applied to very simple 3D cases. A description of the algorithm is presented here along with early results. Further development of the technique is hoped to facilitate useful scaling properties

Continuous reservoir model updating by ensemble Kalman filter on Grid computing architectures

A reservoir engineering Grid computing toolkit, ResGrid and its extensions, were developed and applied to designed reservoir simulation studies and continuous reservoir model updating. The toolkit provides reservoir engineers with high performance computing capacity to complete their projects without requiring them to delve into Grid resource heterogeneity, security certification, or network protocols. Continuous and real-time reservoir model updating is an important component of closed-loop model-based reservoir management. The method must rapidly and continuously update reservoir models by assimilating production data, so that the performance predictions and the associated uncertainty are up-to-date for optimization. The ensemble Kalman filter (EnKF), a Bayesian approach for model updating, uses Monte Carlo statistics for fusing observation data with forecasts from simulations to estimate a range of plausible models. The ensemble of updated models can be used for uncertainty forecasting or optimization. Grid environments aggregate geographically distributed, heterogeneous resources. Their virtual architecture can handle many large parallel simulation runs, and is thus well suited to solving model-based reservoir management problems. In the study, the ResGrid workflow for Grid-based designed reservoir simulation and an adapted workflow provide tools for building prior model ensembles, task farming and execution, extracting simulator output results, implementing the EnKF, and using a web portal for invoking those scripts. The ResGrid workflow is demonstrated for a geostatistical study of 3-D displacements in heterogeneous reservoirs. A suite of 1920 simulations assesses the effects of geostatistical methods and model parameters. Multiple runs are simultaneously executed using parallel Grid computing. Flow response analyses indicate that efficient, widely-used sequential geostatistical simulation methods may overestimate flow response variability when compared to more rigorous but computationally costly direct methods. Although the EnKF has attracted great interest in reservoir engineering, some aspects of the EnKF remain poorly understood, and are explored in the dissertation. First, guidelines are offered to select data assimilation intervals. Second, an adaptive covariance inflation method is shown to be effective to stabilize the EnKF. Third, we show that simple truncation can correct negative effects of nonlinearity and non-Gaussianity as effectively as more complex and expensive reparameterization methods

New Insights into History Matching via Sequential Monte Carlo

The aim of the history matching method is to locate non-implausible regions of the parameter space of complex deterministic or stochastic models by matching model outputs with data. It does this via a series of waves where at each wave an emulator is fitted to a small number of training samples. An implausibility measure is defined which takes into account the closeness of simulated and observed outputs as well as emulator uncertainty. As the waves progress, the emulator becomes more accurate so that training samples are more concentrated on promising regions of the space and poorer parts of the space are rejected with more confidence. Whilst history matching has proved to be useful, existing implementations are not fully automated and some ad-hoc choices are made during the process, which involves user intervention and is time consuming. This occurs especially when the non-implausible region becomes small and it is difficult to sample this space uniformly to generate new training points. In this article we develop a sequential Monte Carlo (SMC) algorithm for implementation which is semi-automated. Our novel SMC approach reveals that the history matching method yields a non-implausible distribution that can be multi-modal, highly irregular and very difficult to sample uniformly. Our SMC approach offers a much more reliable sampling of the non-implausible space, which requires additional computation compared to other approaches used in the literature