Parallel implementation of asynchronous cellular automata on 32-core computer
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 15 (2012) no. 1, pp. 55-65
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper we investigate in what way and how efficiently different parallel algorithms of asynchronous cellular automata simulation can be mapped onto the architecture of modern 32-core computer (4$\times$Intel Xeon X7560). As an example, a model of $\mathrm{CO+O=CO_2}$ reaction on the surface of palladium particle is used.
@article{SJVM_2012_15_1_a4,
author = {K. V. Kalgin},
title = {Parallel implementation of asynchronous cellular automata on 32-core computer},
journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
pages = {55--65},
publisher = {mathdoc},
volume = {15},
number = {1},
year = {2012},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SJVM_2012_15_1_a4/}
}
TY - JOUR AU - K. V. Kalgin TI - Parallel implementation of asynchronous cellular automata on 32-core computer JO - Sibirskij žurnal vyčislitelʹnoj matematiki PY - 2012 SP - 55 EP - 65 VL - 15 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SJVM_2012_15_1_a4/ LA - ru ID - SJVM_2012_15_1_a4 ER -
K. V. Kalgin. Parallel implementation of asynchronous cellular automata on 32-core computer. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 15 (2012) no. 1, pp. 55-65. http://geodesic.mathdoc.fr/item/SJVM_2012_15_1_a4/