Parallel simulation of asynchronous cellular automata evolution

Abstract

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. © Springer-Verlag Berlin Heidelberg 2006.