Abstract
A concept of cellular automata system (CA-system) is introduced as a model of comp[lex phenomena in which several interacting species are involved. CA system suggests a common work of several CA where each processes its own cellular array using in its transition rules cell states of others CA of the system. Taking into account that multi core computers with shared memory are nowadays widely used, a temptation to accelerate the computation by allocating each CA of the system onto one of computer cores is quite natural. Hence, it would be helpful to know what speedup can be obtained by such a parallelization. The paper is aimed to get an answer to this question by determining the conditions, when multicore parallel implementation of CA systems is expedient and correct, and develop the parallelization algorithms for typical CA systems. The results are illustrated by simulation experiments.
Supported by (1) Presidium of Russian Academy of Sciences, Basic Research Program N 2 (2009), (2) Siberian Branch of Russian Academy of Sciences, SBRAS Interdisciplinary Project 32 (2009), (3) Project RFBR 11-01-00567a.
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
Wolfram, S.: Cellular Automata abd Comlexity – Collected paopers. Addison Wesley, Reading (1994)
Hoekstra, A.G., Kroc, J., Sloot, P.M.A. (eds.): Simulating Complex Systems by Cellular Automata. Understanding complex Systems. Springer, Berlin (2010)
Bandman, O.: Cellular Automarta Composition Techniques for Spatial Automata Simulation. In: Hoekstra, A.G., Kroc, J., Sloot, P.M.A. (eds.) Simulating Complex Systems by Cellular Automata. Understanding complex Systems, pp. 81–115. Springer, Berlin (2010)
Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm. Theory and Application. World Scientific, Singapore (1994)
Bandman, O.: Coarse-Grained Parallelization of Cellular-Automata Simulation Algorithms. In: Malyshkin, V.E. (ed.) PaCT 2007. LNCS, vol. 4671, pp. 370–384. Springer, Heidelberg (2007)
Toffolli, T., Margolus, N.: Cellular Automata Machine. MIT Press, USA (1987)
Deutsch, A., Dorman, S.: Cellular Automata Modeling of Biological Pattern Formation. Birkhäuser, Berlin (2005)
Cataneo, G., Dennunzio, A., Farina, F.: A Full Cellular Automaton to Simulate Predatory-Prey Systems. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 446–451. Springer, Heidelberg (2006)
Chua, L.: CNN: a paradigm of complexity. World Scientific, Singapore (2002)
Bandman, O.: Simulating Spatial Dynamics by Pribabilistic Cellular Automata. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 10–16. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bandman, O. (2011). Using Multi Core Computers for Implementing Cellular Automata Systems. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2011. Lecture Notes in Computer Science, vol 6873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23178-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-23178-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23177-3
Online ISBN: 978-3-642-23178-0
eBook Packages: Computer ScienceComputer Science (R0)