Abstract
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.
Supported by Presidium of Russian Academy of Sciences, Basic Research Program N 17-6 (2004).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Toffolli, T., Margolus, N.: Cellular Automata Machines. MIT Press, USA (1987)
Rothman, D.H., Zaleski, S.: Lattice-Gas Cellular Automata. Simple Models of Complex Hydrodynamics. Cambridge University Press, London (1997)
Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign, Ill, USA (2002)
Latkin, E.I., Elokhin, V.I., Gorodetskii, V.V.: Spiral concentration waves in the Monte-Carlo model of CO oxidation over Pd(110) caused by synchronization via CO a ds diffusion between separate parts of catalytic surface. Chemical Engineering Journal 91, 123–131 (2003)
Bandman, O.: Simulation Spatial Dynamics by Probabilistic Cellular Automata. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 10–19. Springer, Heidelberg (2002)
Weimar, J.R.: Cellular Automata for reaction-diffusion systems. Parallel Computing 23(11), 1699–1715 (1997)
Bandman, O.: Algebraic Properties of Cellular Automata: the Basis for Composition Technique. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 688–698. Springer, Heidelberg (2004)
Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm. Theory and Application. World Scientific, Singapore (1994)
Bandman, O.: Accuracy and Stability of Spatial dynamics Simulation by Cellular Automata Evolution. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 20–34. Springer, Heidelberg (2003)
Bandman, O.: Spatial Functions Approximation by Boolean Arrays. In: Bulletin of Novosibirsk Computer Center, series Computer Science, Novosibirsk, ICMMG, vol. 19, pp. 10–19 (2003)
Chopard, B., Droz, M.: Cellular Automata Approach to nonequilibrium phase transition in a surface reaction model: static and dynamics properties. Journal of Phisics A. Mathematical and General 21, 205–211 (1988)
Svirezhev, Y.: Nonlinear waves, dissipsative structures and catastrophes in ecology. Nauka, Moscow (1987)
Vichniac, G.: Simulating Physics by Cellular Automata. Physica D 10, 86–112 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bandman, O. (2005). Composing Fine-Grained Parallel Algorithms for Spatial Dynamics Simulation. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_9
Download citation
DOI: https://doi.org/10.1007/11535294_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28126-9
Online ISBN: 978-3-540-31826-2
eBook Packages: Computer ScienceComputer Science (R0)