Abstract
The procedure for spatial sequential simulation – bi-point or multi-point stochastic simulation – of any type of variable starts with the definition of a random path which the simulation should follow in order to generate a structured image of a given attribute. One problem of these algorithms is related to the effort a single processor is required to undertake, especially when applying them to very large grids of nodes.
With the advent of parallel computing and multi-core processors (or multiple execution cores), which are expected to drive a new era of performance and flexibility, providing platforms that can better handle escalating workloads and rapidly evolving usage models, it becomes clear that a scalable parallelization scheme should be developed to allow the usage of such processors to allow for considerable reduction in time spent performing simulations, with clear advantages when used with clusters of multi-processor (or multiple execution core) nodes.
The general idea is to partition the universe in a given number of sections, equal in number to double the number of processors or execution cores, in such a way that the locations to be concurrently simulated are sufficiently apart to be outside search range or multi-point template range. This is only applicable in cases where at least one of the dimensions of the area to be simulated is greater then the chosen range in that direction, which is admitted to be true for cases where parallelization is valuable, particularly for very large fine scale models.
The number of sections, or regions, at which the volume will be segmented is given by an optimization procedure that maximizes the size of each region and minimizes the number of nodes to be sequentially simulated, based on the number of available processors or execution cores.
The results of the proposed parallel simulation method were checked in order to evaluate if they succeeded to reproduce the spatial continuity and spatial patterns of the phenomenon and its distribution function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Yamani, A., Sait, S., Youssef, H. and Barada, H. (2002). Parallelizing tabu search on a cluster of heterogeneous workstations. Journal of Heuristics, 8: 277–304.
Benkner, S. and Brandes, F. (2001). High-Level Data Mapping for Clusters of SMPs. Lecture Notes in Computer Science, Vol. 2026, Springer-Verlag, p. 1
Chin, W., Khoo, S., Hu, Z., and Takeichi, M. (2000). Deriving parallel codes via invariants. Lecture Notes in Computer Science, Vol. 1824, Springer-Verlag, pp. 75–94.
Crauser, A., Mehlhorn, K., Meyer, U. and Sanders, P. (1998). A parallelization of Dijkstra’s shortest path algorithm. Lecture Notes in Computer Science, Vol. 1450, Springer-Verlag,p. 722.
Deutsch, C.V. and Journel, A.G. (1998). GSLIB: Geostatistical Software Library and User’s Guide, 2nd Edition, Oxford University Press, New York, 368p.
Dimitrakopoulos, R. and Luo, X. (2004). Generalized sequential Gaussian simulation on group size ν and screen-effect approximations for large field simulations. Mathematical Geology, Vol. 36, No. 5, pp. 567–591.
Gómez-Hernández, J. and Journel, A.G. (1993) Joint sequential simulation of multi Gaussian fields. In A. Soares, editor, Geostatistics Troia ‘92, colume 1, pages 85–94. Kluwer Academic Publishers. Dordrecht
Goovaerts, P. (1997). Geostatistics for Natural Resources Evaluation. Oxford University Press, New York. 483p.
Li, X., Jin, R.and Agrawal, G. (2005). Compiler and runtime support for shared memory parallelization of data mining algorithms. Lecture Notes in Computer Science, Vol. 2481, Springer-Verlag. DOI: 10.1007/11596110
Nikravesh, M. and Aminzadeh, F. (2001). Past, present and future intelligent reservoir characterization trends. Journal of Petroleum Science and Engineering, 31:67–79
Oye, G. and Hilde Reme, H. (1999). Parallelizations of a compositional simulator with a Galerkin coarse/fine method. Lecture Notes in Computer Science, Vol. 1685, Springer-Verlag, p. 586.
Peigin, S. and Epstein, B. (2004). Embedded parallelization approach for optimization in aerodynamic design. The Journal of Supercomputing, Vol. 29, pp. 243–263.
Soares, A.O. (2006). Geoestatística para as Ciências da Terra e do Ambiente. 2a Edição, Colecção Ensino da Ciência e da Tecnologia, IST Press, Lisboa, 206p.
Uchihira, N., Kawata, H. and Tamura, F. (1997). Scenario-based hypersequential programming: Formulation of parallelization. Lecture Notes in Computer Science, Vol. 1336, Springer-Verlag, pp. 267–280.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Vargas, H., Caetano, H., Mata-Lima, H. (2008). A New Parallelization Approach for Sequential Simulation. In: Soares, A., Pereira, M.J., Dimitrakopoulos, R. (eds) geoENV VI – Geostatistics for Environmental Applications. Quantitative Geology and Geostatistics, vol 15. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6448-7_40
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6448-7_40
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6447-0
Online ISBN: 978-1-4020-6448-7
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)