Skip to main content
SpringerLink
Log in

GCA: Global Cellular Automata. A Flexible Parallel Model

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

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

Included in the following conference series:

Abstract

A model called global cellular automata (GCA) will be introduced. The new model preserves the good features of the cellular automata but overcomes its restrictions. In the GCA the cell state consists of a data field and additional pointers. Via these pointers, each cell has read access to any other cell in the cell field, and the pointers may be changed from generation to generation. Compared to the cellular automata the neighbourhood is dynamic and differs from cell to cell. For many applications parallel algorithms can be found straight forward and can directly be mapped on this model. As the model is also massive parallel in a simple way, it can efficiently be supported by hardware.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Achasova, O. Bandman, V. Markova, and S. Piskunov. Parallel Substitution Algorithm. World Scientific, P O BOX 128, Farrer Road, Singapore 9128, 1994.

    MATH  Google Scholar 

  2. Christian Hochberger, Rolf Hoffmann, and Stefan Waldschmidt. Compilation of CDL for different target architecures. In Viktor Malyshkin, editor, Parallel Computing Technologies, pages 169–179, Berlin, Heidelberg, 1995. Springer.

    Google Scholar 

  3. Rolf Hoffmann, Bernd Ulmann, Klaus-Peter Völkmann, and Stefan Waldschmidt. A stream processor architecture based on the configurabel CEPRA-S. In Reiner W. Hartenstein and Herbert Grünbacher, editors, Field-Programmable Logic and Applications, pages 822–825, Berlin, Heidelberg, 2000. Springer.

    Google Scholar 

  4. A.N. Kolmogorov and V.A. Uspenskii. On the definition of an algorithm. In American Mathematical Society Translations, volume 9 of Series 2, pages 217–245. American Mathematical Society, 1963.

    Google Scholar 

  5. Arnold Schönhage. Real-time simulation of multidimensional turing machines by storage modification machines. SIAM Journal on Computing, 9(3):490–508, August 1980.

    Google Scholar 

  6. Samuel D. Stearns. Digital Signal Analysis. Hayden Book Company, Rochelle Park, New Jersey, 1975.

    MATH  Google Scholar 

  7. T. Toffoli and N. Margolus. Cellular Automata Machines. MIT Press, Cambridge Mass., 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Darmstadt University of Technology, Alexanderstr. 10, D-64283, Darmstadt, Germany

    Rolf Hoffmann, Klaus-Peter Völkmann, Stefan Waldschmidt & Wolfgang Heenes

Authors
  1. Rolf Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus-Peter Völkmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Waldschmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wolfgang Heenes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Supercomputer Software Department, ICMand MG SB RAS, pr. Lavrentiev 6, 630090, Novosibirsk, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoffmann, R., Völkmann, KP., Waldschmidt, S., Heenes, W. (2001). GCA: Global Cellular Automata. A Flexible Parallel Model. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44743-1_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42522-9

  • Online ISBN: 978-3-540-44743-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation