Development of parallel percolation algorithms
News of the Kabardin-Balkar scientific center of RAS, no. 1 (2011), pp. 108-111
Cet article a éte moissonné depuis la source Math-Net.Ru
The author have studied the two-dimensional percolation problem on a square lattice with separation probabilities of formation of horizontal and vertical linkages. The algorithm was developed for modeling in which parallel programming technologies were realized using library Parallel Extensions to the.NET Framework developed by Microsoft.
Keywords:
percolation, modeling, programming, parallel computing, cluster.
@article{IZKAB_2011_1_a18,
author = {V. A. Denisenko},
title = {Development of parallel percolation algorithms},
journal = {News of the Kabardin-Balkar scientific center of RAS},
pages = {108--111},
year = {2011},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a18/}
}
V. A. Denisenko. Development of parallel percolation algorithms. News of the Kabardin-Balkar scientific center of RAS, no. 1 (2011), pp. 108-111. http://geodesic.mathdoc.fr/item/IZKAB_2011_1_a18/
[1] B. I. Shklovskii, A. L. Efros, Elektronnye svoistva legirovannykh poluprovodnikov, Nauka, M., 1979
[2] B. I. Shklovskii, A. L. Efros, UFN, 117 (3), (1975), 401, 436 | DOI
[3] Yu. Yu. Tarasevich, Perkolyatsiya: teoriya, prilozheniya, algoritmy, Editorial URSS, M., 2002, 112 pp.
[4] R. Hockney, “The communication challenge for MPP: Intel Paragon and Meiko CS-2”, Parallel Computing, 20, (1994), 389–398 | DOI | MR
[5] J. Hoshen, R. Kopeelman, Phys. Rev. B, 14(8), (1976), 3445-3438 | DOI