Skip to main content
SpringerLink
Log in

Expanding the Cellular Automata Topologies Library for Parallel Implementation of Synchronous Cellular Automata

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14098))

Included in the following conference series:

  • 167 Accesses

Abstract

The paper discusses the implementation of cellular automata on supercomputers. It outlines the requirements for the software: ease of program construction and usability, ability to handle a wide range of transition functions, compatibility with various platforms, and ability to scale the size of cellular arrays with efficient use of computational resources. A review of software tools suitable for implementing cellular automata was conducted. One of these tools, a library of cellular automata topologies (CATlib), has been extended to implement synchronous cellular automata in parallel on multicomputers. The paper presents performance evaluation results emphasizing the high efficiency of the parallel implementation.

This work was carried out under the state contract with ICMMG SB RAS 0251-2022-0005.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://gitlab.ssd.sscc.ru/medvedev/catlib

References

  1. Von Neumann, J.: General and logical Theory of Automata, Hixon Symposium, reprinted in Taub, A.H. (ed.) Collected Works, vol. 288–328 (1948/1961)

    Google Scholar 

  2. Vanag, V.K.: Study of spatially extended dynamical systems using probabilistic cellular automata. Phys. Usp. 42(5), 413–434 (1999). https://doi.org/10.1070/PU1999v042n05ABEH000558

    Article  Google Scholar 

  3. Bandman O.: Implementation of large-scale cellular automata models on multi-core computers and clusters. In: International Conference on High Performance Computing & Simulation (HPCS), Helsinki, Finland, pp. 304–310 (2013). https://doi.org/10.1109/HPCSim.2013.6641431

  4. Medvedev, Yu.G.: Architecture of the cellular automata topologies library. Bull. Nov. Comput. Center Comput. Sci. (46) (2022)

    Google Scholar 

  5. Pogudin, Y., Bandman, O.: Simulating cellular computations with ALT. A tutorial. In: Malyshkin, V. (ed.) PaCT 1997. LNCS, vol. 1277, pp. 424–435. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63371-5_52

    Chapter  Google Scholar 

  6. Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm. Theory and Application. World Scientific Publ. (1994). https://doi.org/10.1142/2369. 232 p

  7. Piskunov, S.: WinALT - a simulation system for computations with spatial parallelism. Bull. Nov. Comput. Center Comput. Sci. (6), 71–85 (1997)

    Google Scholar 

  8. Beletkov, D., Ostapkevich, M., Piskunov, S., Zhileev, I.: WinALT, a software tool for fine-grain algorithms and structures synthesis and simulation. In: Malyshkin, V. (ed.) PaCT 1999. LNCS, vol. 1662, pp. 491–496. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48387-X_57

    Chapter  Google Scholar 

  9. Mirek’s Cellebration, 1-D and 2-D Cellular Automata viewer, explorer and editor. http://www.mirekw.com/ca/index.html. Accessed 1 May 2023

  10. Homeyer, A.: A Brief Introduction To Cafun. https://cafun.de/information/a_brief_introduction_to_cafun/index.html. Accessed 1 May 2023

  11. Golly Game of Life Home Page. https://golly.sourceforge.io. Accessed 1 May 2023

  12. Gardner, M.: Mathematical Games - The fantastic combinations of John Conway’s new solitaire game “life”. Sci. Am. 223(4), 120–123 (1970). https://doi.org/10.1038/scientificamerican1070-120

  13. Tiled, C.A.: http://linuxenvy.com/bprentice/TiledCA/TiledCA.html. Accessed 1 May 2023

  14. CellularAutomaton - Wolfram Language Documentation. https://reference.wolfram.com/language/ref/CellularAutomaton.html. Accessed 1 May 2023

  15. Wolfram, S.: Cellular automata as models of complexity. Nature 311, 419–424 (1984). https://doi.org/10.1038/311419a0

    Article  Google Scholar 

  16. Cellular Automata Laboratory. https://www.fourmilab.ch/cellab/manual. Accessed 1 May 2023

  17. Athanassopoulos, S., Kaklamanis, C., Kalfoutzos, G., Papaioannou, E.: Cellular automata: simulations using Matlab. In: Proceedings of the Sixth International Conference on Digital Society (ICDS), pp. 63–68 (2012)

    Google Scholar 

  18. Duarte Duarte, J.B., Talero Sarmiento, L.H., Sierra Juárez, K.J.: Evaluation of the effect of investor psychology on an artificial stock market through its degree of efficiency. Contaduríay Administración 62(4), 1361–1376 (2017). https://doi.org/10.1016/j.cya.2017.06.014

  19. Chivers, I., Sleightholme, J.: Coarray Fortran. In: Introduction to Programming with Fortran, pp. 501–512. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17701-4_32

    Chapter  MATH  Google Scholar 

  20. Bakhtin, V.A., Krukov, V.A.: DVM-approach to the automation of the development of parallel programs for clusters. Program. Comput. Softw. 45, 121–132 (2019). https://doi.org/10.1134/S0361768819030034

    Article  Google Scholar 

  21. Carlson, W., Draper, J., Culler, D., et al.: Introduction to UPC and Language Specification. CCS-TR-99-157, IDA Center for Computing Sciences (1999)

    Google Scholar 

  22. Slaughter, E., Lee, W., Treichler, S., Bauer, M., Aiken, A.: Regent: a high-productivity programming language for HPC with logical regions. In: SC 2015: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, Austin, TX, USA, pp. 1–12 (2015). https://doi.org/10.1145/2807591.2807629

  23. Akhmed-Zaki, D., Lebedev, D., Malyshkin, V., Perepelkin, V.: Automated construction of high performance distributed programs in LuNA system. In: Malyshkin, V. (ed.) PaCT 2019. LNCS, vol. 11657, pp. 3–9. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25636-4_1

    Chapter  Google Scholar 

  24. Medvedev, Yu.G.: Lattice gas cellular automata for a flow simulation and their parallel implementation. In: Tarkov, M.S. (ed.) Parallel Programming: Practical Aspects, Models and Current Limitations. Series: Mathematics Research Developments, pp. 143–158. Nova Science Publishers, Inc., Hauppauge, New York (2014)

    Google Scholar 

  25. Hoffmann, R., Désérable, D., Seredyński, F.: A probabilistic cellular automata rule forming domino patterns. In: Malyshkin, V. (ed.) PaCT 2019. LNCS, vol. 11657, pp. 334–344. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25636-4_26

    Chapter  Google Scholar 

  26. Hoffmann, R., Désérable, D., Seredyński, F.: A cellular automata rule placing a maximal number of dominoes in the square and diamond. J. Supercomput. 77, 9069–9087 (2021). https://doi.org/10.1007/s11227-020-03549-8

    Article  Google Scholar 

  27. Hoffmann, R., Désérable, D., Seredyński, F.: Minimal covering of the space by domino tiles. In: Malyshkin, V. (ed.) PaCT 2021. LNCS, vol. 12942, pp. 453–465. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-86359-3_35

    Chapter  Google Scholar 

  28. Kireev, S., Trubitsyna, Yu.: Software implementation of asynchronous and synchronous cellular automata with maximum domino tiles coverage. Bull. Nov. Comput. Center Comput. Sci. (46) (2022)

    Google Scholar 

  29. Savin, G.I., Shabanov, B.M., Telegin, P.N., et al.: Joint supercomputer center of the Russian Academy of Sciences: present and future. Lobachevskii J. Math. 40, 1853–1862 (2019). https://doi.org/10.1134/S1995080219110271

  30. Medvedev, Y.: Dynamic load balancing for lattice gas simulations on a cluster. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 175–181. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23178-0_15

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia

    Yuri Medvedev & Sergey Kireev

  2. Novosibirsk State University, Novosibirsk, Russia

    Yuri Medvedev, Sergey Kireev & Yulia Trubitsyna

Authors
  1. Yuri Medvedev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Kireev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yulia Trubitsyna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuri Medvedev .

Editor information

Editors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Medvedev, Y., Kireev, S., Trubitsyna, Y. (2023). Expanding the Cellular Automata Topologies Library for Parallel Implementation of Synchronous Cellular Automata. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2023. Lecture Notes in Computer Science, vol 14098. Springer, Cham. https://doi.org/10.1007/978-3-031-41673-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-41673-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-41672-9

  • Online ISBN: 978-3-031-41673-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation