Optimisation issues in 3D multiple-point statistics simulation

Multiple-point statistics simulation has gained wide acceptance in recent years and is routinely used for simulating geological heterogeneity in hydrocarbon reservoirs and aquifers. In classical implementations, the multiple-point statistics inferred from the reference training image are stored in a dynamic data structure called search tree. The size of this search tree depends on the search template used to scan the training image and the number of facies to be simulated. In 3D applications this size can become prohibitive. One promissing avenue for drastically reducing the RAM requirements consists of using dynamically allocated lists instead of search trees to store and retrieve the multiple–point statistics. Each element of this list contains the identification of the data event together with occurence counters for each facies. First results show that implementing this list based approach results in reductions of RAM requirement by a factor 10 and more. The paper discusses in detail this novel list based approach, presents RAM and CPU performance comparisons with the (classical) tree based approach.

Notes

, 2008

Nom de l'événement

VIII International Geostatistical Congress

Lieu

Santiago, Chile

Identifiants

https://libra.unine.ch/handle/123456789/21148