Return
A general parallelization strategy for random path based geostatistical simulation methods
DOI:10.1016/j.cageo.2009.11.001.png)
Abstract
En 中文
The size of simulation grids used for numerical models has increased by many orders of magnitude in the past years, and this trend is likely to continue. Efficient pixel-based geostatistical simulation algorithms have been developed, but for very large grids and complex spatial models, the computational burden remains heavy. As cluster computers become widely available, using parallel strategies is a natural step for increasing the usable grid size and the complexity of the models. These strategies must profit from of the possibilities offered by machines with a large number of processors. On such machines, the bottleneck is often the communication time between processors. We present a strategy distributing grid nodes among all available processors while minimizing communication and latency times. It consists in centralizing the simulation on a master processor that calls other slave processors as if they were functions simulating one node every time. The key is to decouple the sending and the receiving operations to avoid synchronization. Centralization allows having a conflict management system ensuring that nodes being simulated simultaneously do not interfere in terms of neighborhood. The strategy is computationally efficient and is versatile enough to be applicable to all random path based simulation methods. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Geostatistics
Simulation
Parallelization
Sequential simulation
Multiple-point
Multiple-points
MPI
Speed-up
Parallel computing
Random path
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.4
Papers:
5.0K
Citations:
1.5W
Organization
No organization information available

