Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Cellular automata for reaction-diffusion systems
Parallel Computing - Special issue: cellular automata
A new kind of science
Parallel Substitution Algorithm: Theory and Application
Parallel Substitution Algorithm: Theory and Application
Simulating Spatial Dynamics by Probabilistic Cellular Automata
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
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
Using cellular automata for porous media simulation
The Journal of Supercomputing
Coarse-grained parallelization of cellular-automata simulation algorithms
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
A class of fine-grained (FG) parallel models and algorithms is defined as a generalization of Cellular Automata (CA). It comprises all CA-modifications, in which two main CA-properties (locality and parallelism of intercell interaction) are preserved, no constraint being imposed on state alphabets and transition functions. A set of methods for composing a complex FG-algorithm out of a number of simple ones is proposed. To make compatible FG-algorithms with different alphabets, a number of algebraic operations on cellular arrays are introduced. The set of proposed composition methods has a two-level structure: the lower level comprises composition of cell transition functions, while the higher level deals with global operators on cellular arrays. For each type of proposed methods an example is given and the domain of application is determined.