Abstract:
The parallel implementation peculiarities of a discrete stochastic model that simulates water permeation through a porous substance (soil) with a complex morphology are studied. The simulation should reveal the fluid flowing along pore curves and filling wets and cavities. The discrete stochastic model of the process, proposed earlier, is a stochastic cellular automaton (SCA), whose functioning is represented by a set of elementary local operators acting in a cellular space and imitating displacement (diffusion. convection, adsorption) and transformations (reaction, phase transition) of abstract or real particles. The microlevel of the process representation requires the cellular space of a huge size, and hence, the computations should be implemented on supercomputers. With this, the main problem is in the fact that obtaining an acceptable parallelization efficiency is possible only by inserting some determinism into the computation algorithm, i.e., by decreasing the model stochasticity. Although stochastic models are under intensive investigation, the parallel implementation methods for them are poorly studied. This gap is partially covered by the results of computational experiments, given in this paper, which allow one to assess the advantages and drawbacks of methods for the discrete stochastic mode of water permeation though implementing a porous medium on a multicore cluster.
Key words:
discrete simulation methods, stochastic cellular automata, stochasticity of the algorithm, transition rules, parallel computing, block-synchronous mode of functioning, porous material, permeation model.
Citation:
O. L. Bandman, “A discrete stochastic model of water permeation through a porous substance: parallel implementation peculiarities”, Sib. Zh. Vychisl. Mat., 21:1 (2018), 5–21; Num. Anal. Appl., 11:1 (2018), 4–15
\Bibitem{Ban18}
\by O.~L.~Bandman
\paper A discrete stochastic model of water permeation through a~porous substance: parallel implementation peculiarities
\jour Sib. Zh. Vychisl. Mat.
\yr 2018
\vol 21
\issue 1
\pages 5--21
\mathnet{http://mi.mathnet.ru/sjvm665}
\crossref{https://doi.org/10.15372/SJNM20180101}
\elib{https://elibrary.ru/item.asp?id=32466476}
\transl
\jour Num. Anal. Appl.
\yr 2018
\vol 11
\issue 1
\pages 4--15
\crossref{https://doi.org/10.1134/S1995423918010020}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000427431900001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85043704828}
Linking options:
https://www.mathnet.ru/eng/sjvm665
https://www.mathnet.ru/eng/sjvm/v21/i1/p5
This publication is cited in the following 2 articles:
D. V. Alekseev, G. A. Kazunina, “Soputstvuyuschaya klasternaya struktura, formiruemaya algoritmom Khammersli–Lisa–Aleksandrovitsa pri generatsii perkolyatsionnykh klasterov”, PDM, 2020, no. 47, 117–127