New Approach in Gas Injection Miscible Processes Modelling in Compositional Simulation

2006 ◽  
Vol 45 (08) ◽  
Author(s):  
E. Shtepani ◽  
F.B. Thomas ◽  
D.B. Bennion
SPE Journal ◽  
2006 ◽  
Vol 11 (03) ◽  
pp. 294-302 ◽  
Author(s):  
Bradley T. Mallison ◽  
Margot G. Gerritsen ◽  
Sebastien F. Matringe

Summary Our interest lies in extending the streamline method to compositional simulation. In this paper, we develop improved mappings to and from streamlines that are necessary to obtain reliable predictions of gas injection processes. Our improved mapping to streamlines uses a piecewise linear representation of saturations on the background grid in order to minimize numerical smearing. Our strategy for mapping saturations from streamlines to the background grid is based on kriging. We test our improvements to the streamline method by use of a simple model for miscible flooding based on incompressible Darcy flow. Results indicate that our mappings offer improved resolution and reduce mass-balance errors relative to the commonly used mappings. Our mappings also require fewer streamlines to achieve a desired level of accuracy. In compositional cases where the computational cost of a streamline solve is high, we anticipate that this will lead to an improvement in the efficiency of streamline-based simulation. Introduction The overall goal of our research is to improve the accuracy and efficiency of the streamline method in simulating compositional problems such as those that occur in miscible or near-miscible gas injection processes. This is our second paper suggesting improvements to this end. In Mallison et al. (2005) we investigated a 1D compositional finite-difference solver based on a high-order upwind scheme and adaptive mesh refinement that is appropriate for use in a compositional streamline simulator. Here, we propose new mappings to and from streamlines that improve the accuracy of the streamline method for problems in which the flow pattern does not remain fixed for large time intervals. Such problems require that streamlines be periodically updated in order to account for changing flow directions and for the treatment of gravity terms (Thiele et al. 1996; Bratvedt et al. 1996). For each set of streamlines, fluids must be mapped from an underlying background grid, on which the pressure is solved (or, say, the flow), to the streamlines, moved forward in time, and then mapped from the streamlines back to the background grid. The mappings introduce numerical smearing and generally also mass-balance errors. When streamlines are updated frequently, the mapping errors limit the overall accuracy of the streamline method. Our improved mapping algorithms are aimed at minimizing this type of error.


SPE Journal ◽  
2013 ◽  
Vol 19 (02) ◽  
pp. 304-315 ◽  
Author(s):  
Yuhe Wang ◽  
John E. Killough

Summary The quest for efficient and scalable parallel reservoir simulators has been evolving with the advancement of high-performance computing architectures. Among the various challenges of efficiency and scalability, load imbalance is a major obstacle that has not been fully addressed and solved. The causes of load imbalance in parallel reservoir simulation are both static and dynamic. Robust graph-partitioning algorithms are capable of handling static load imbalance by decomposing the underlying reservoir geometry to distribute a roughly equal load to each processor. However, these loads that are determined by a static load balancer seldom remain unchanged as the simulation proceeds in time. This so-called dynamic imbalance can be exacerbated further in parallel compositional simulations. The flash calculations for equations of state (EOSs) in complex compositional simulations not only can consume more than half of the total execution time but also are difficult to balance merely by a static load balancer. The computational cost of flash calculations in each gridblock heavily depends on the dynamic data such as pressure, temperature, and hydrocarbon composition. Thus, any static assignment of gridblocks may lead to dynamic load imbalance in unpredictable manners. A dynamic load balancer can often provide solutions for this difficulty. However, traditional techniques are inflexible and tedious to implement in legacy reservoir simulators. In this paper, we present a new approach to address dynamic load imbalance in parallel compositional simulation. It overdecomposes the reservoir model to assign each processor a bundle of subdomains. Processors treat these bundles of subdomains as virtual processes or user-level migratable threads that can be dynamically migrated across processors in the run-time system. This technique is shown to be capable of achieving better overlap between computation and communication for cache efficiency. We use this approach in a legacy reservoir simulator and demonstrate a reduction in the execution time of parallel compositional simulations while requiring minimal changes to the source code. Finally, it is shown that domain overdecomposition, together with a load balancer, can improve speedup from 29.27 to 62.38 on 64 physical processors for a realistic simulation problem.


Sign in / Sign up

Export Citation Format

Share Document