Advertisement

Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w)

  • Rolf HoffmannEmail author
Part of the Emergence, Complexity and Computation book series (ECC, volume 12)

Abstract

The CA-w model (cellular automata with write-access) was introduced in order to simplify the description of problemswith dynamic activities, like moving agents or active particles in a grid of cells. This model allows an active cell to send data to a neighboring cell. Thereby neighbors can be activated or deactivated, or the movement of agents can directly be described. The usefulness of the model is demonstrated for basic computational problems, the well-known 1-D CA traffic rule, Pascal’s triangle, Fibonacci numbers, sorting on the ring by agents, and leader election for agents.

Keywords

Cellular Automaton Cellular Automaton Fibonacci Number Leader Election Cellular Automaton Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithms, Theory and Applications. World Scientific (1994)Google Scholar
  2. 2.
    Haberman, N.: Parallel Neighbor Sort (or the Glory of the Induction Principle) CMU Computer Science Report (available as Technical report AD-759 248, National Technical Information Service, US Department of Commerce, 5285 Port Royal Rd Sprig field VA 22151) (1972)Google Scholar
  3. 3.
    Hoffmann, R., Völkmann, K.-P., Waldschmidt, S.: Global Cellular Automata GCA: An Universal Extension of the CA Model. In: Worsch, T. (ed.) ACRI Conf. Work in Progress Session (2000)Google Scholar
  4. 4.
    Hoffmann, R., Völkmann, K.-P., Waldschmidt, S., Heenes, W.: GCA: Global Cellular Automata. A Flexible Parallel Model. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol. 2127, p. 66. Springer, Heidelberg (2001)Google Scholar
  5. 5.
    Hoffmann, R.: GCA-w Algorithms for Traffic Simulation. Acta Physica Polonia. In: Proc. Suppl. Summer Solistice Int. Conf. on Discr. Models of Complex Systems, Nancy France. Polish Academy of Science, Cracow (2011)Google Scholar
  6. 6.
    Hoffmann, R.: The GCA-w Massively Parallel Model. In: Malyshkin, V. (ed.) PaCT 2009. LNCS, vol. 5698, pp. 194–206. Springer, Heidelberg (2009)Google Scholar
  7. 7.
    Hoffmann, R.: GCA-w: Global Cellular Automata with Write-Access. In: Acta Physica Polonia Proc. Suppl. Summer Solistice Int. Conf. on Discr. Models of Complex Systems Gdansk 2009. Polish Academy of Science, Cracow (2010)Google Scholar
  8. 8.
    Hoffmann, R.: Rotor-routing Algorithms Described by CA-w. In: Acta Physica Polonia Proc. Suppl. Summer Solistice Int. Conf. on Discr. Models of Complex Systems Turku, Finland 2011, Turku, Finland. Polish Academy of Science, Cracow (2012)Google Scholar
  9. 9.
    JaJa, J.: An Introduction to Parallel Algorithms. Addison-Wesley (1992)Google Scholar
  10. 10.
    Keller, J., Kessler, C., Träff, J.: Practical PRAM Programming. Wiley (2001)Google Scholar
  11. 11.
    LeLann, G.: Distributed Systems: towards a formal approach. In: Gilchrist, B. (ed.) Proc. Information Processing, pp. 155–160. North Holland (1977)Google Scholar
  12. 12.
    Schweitzer, F.: Brownian Agents and Active Particles, Collective Dynamics in the Natural and Social Sciences. Springer Series in Synergetics. Springer (2003)Google Scholar
  13. 13.
    Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (1994)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.FG RechnerarchitekturTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations