A new kind of science
Parallel Substitution Algorithm: Theory and Application
Parallel Substitution Algorithm: Theory and Application
Implementation of Fine-Grained Algorithms on Graphical Processing Unit
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Discrete models of physicochemical processes and their parallel implementation
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Parallel implementation of kinetic cellular automata for modeling CO oxidation over Pd(110) surface
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Simulation of heterogeneous catalytic reaction by asynchronous cellular automata on multicomputer
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Coarse-grained parallelization of cellular-automata simulation algorithms
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as Monte-Carlo methods The simulation requires huge cellular space and millions of iterative steps for obtaining the CA evolution representing the real scene of the process This may be achieved by allocating the CA evolution program onto a multiprocessor system As distinct from the synchronous CAs which is extremely efficient, the asynchronous case of parallel implementation is stiff To improve the situation we propose a method for approximating asynchronous CA by a superposition of a number of synchronous ones, each being applied to locally separated blocks forming a partition of the cellular array.