Comparative study of parallel algorithms for asynchronous cellular automata simulation on different computer architectures

Authors:
Konstantin Kalginf
Affiliations:
Institute of Computational Mathematics and Mathematical Geophysics SB RAS
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 2
Cited 1

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel simulation of asynchronous cellular automata evolution

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

Domain specific language and translator for cellular automata models of physico-chemical processes

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Overview and experimental comparative study of parallel algorithms of asynchronous cellular automata simulation is presented. The algorithms are tested for the model of physicochemical process of surface CO + O2 reaction over the supported Pd nanoparticles on different parallel computers. For testing we use shared memory computers, distributed memory computers (i.e. clusters), and graphical processing unit. Characterization of these algorithms in respect of methods of parallelism maintenance is given.