Parallel Multiple-Point Statistics Algorithm Based on List and Tree Structures |
| |
| Authors: | Julien Straubhaar Alexandre Walgenwitz Philippe Renard |
| |
| Institution: | 1. The Centre for Hydrogeology and Geothermics (CHYN), University of Neuchatel, rue Emile-Argand 11, 2000, Neuchatel, Switzerland
2. Ephesia Consult SA, rue Boissonnas 9, 1227, Geneva, Switzerland
|
| |
| Abstract: | Multiple-point statistics are widely used for the simulation of categorical variables because the method allows for integrating a conceptual model via a training image and then simulating complex heterogeneous fields. The multiple-point statistics inferred from the training image can be stored in several ways. The tree structure used in classical implementations has the advantage of being efficient in terms of CPU time, but is very RAM demanding and then implies limitations on the size of the template, which serves to make a proper reproduction of complex structures difficult. Another technique consists in storing the multiple-point statistics in lists. This alternative requires much less memory and allows for a straightforward parallel algorithm. Nevertheless, the list structure does not benefit from the shortcuts given by the branches of the tree for retrieving the multiple-point statistics. Hence, a serial algorithm based on list structure is generally slower than a tree-based algorithm. In this paper, a new approach using both list and tree structures is proposed. The idea is to index the lists by trees of reduced size: the leaves of the tree correspond to distinct sublists that constitute a partition of the entire list. The size of the indexing tree can be controlled, and then the resulting algorithm keeps memory requirements low while efficiency in terms of CPU time is significantly improved. Moreover, this new method benefits from the parallelization of the list approach. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
