Skip to main content
SpringerLink
Log in
Book cover

Workshop on Parallel Processing: Logic, Organization, and Technology

WOPPLOT 1989: Parallelism, Learning, Evolution pp 137–147Cite as

Some remarks on synchronization problems

  • Conference paper
  • First Online:

  • 157 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 565))

Abstract

In this paper some hints to synchronization problems and to their solutions in cellular automata are reviewed and two modifications are introduced.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.M. Balzer An 8-state minimal time solution to the firing squad synchronization problem Information and Control 10 (1967), 22–42

    Google Scholar 

  2. C.D. Dyer, A. Rosenfeld Parallel image processing by memory-augmented cellular automata IEEE Trans. on Pattern Analysis and Machine Intelligence PAMI-3 (1981), 29–41

    Google Scholar 

  3. H.-D. Gerken über Synchronisationsprobleme bei Zellularautomaten Diploma Thesis, Braunschweig, 1987

    Google Scholar 

  4. G.T. Herman, W.H. Liu The daughter of Celia, the French flag, and the firing squad Simulation 21 (1973), 33–41

    Google Scholar 

  5. G.T. Herman, W.H. Liu, S. Rowland, A. Walker Synchronization of growing cellular arrays Information and Control 25 (1974), 103–121

    Google Scholar 

  6. M. Kutrib, R. Vollmar Minimal time synchronization in restricted defective cellular automata submitted for publication

    Google Scholar 

  7. M. Kutrib, R. Vollmar The firing squad synchronization problem in defective cellular automata submitted for publication

    Google Scholar 

  8. R.J. Lipton, R.E. Miller, L. Snyder Synchronization and computing capabilities of linear asynchronous structures J. of Computer and System Sciences 14 (1977), 49–72

    Google Scholar 

  9. J. Mazoyer A six-state minimal time solution to the firing squad synchronization problem Theoretical Computer Science 50 (1987), 183–238

    Google Scholar 

  10. J. Mazoyer An overview of the firing squad synchronization problem In: C. Choffrut (Ed.) Automata Networks Springer, Berlin, 1988, 82–94

    Google Scholar 

  11. H. Szwerinski Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position Theoretical Computer Science 19 (1982), 305–320

    Google Scholar 

  12. H. Szwerinski Zellularautomaten mit symmetrischer lokaler Transformation PhD Thesis, Braunschweig, 1982

    Google Scholar 

  13. R. Vollmar Algorithmen in Zellularautomaten Teubner, Stuttgart, 1979

    Google Scholar 

  14. R. Vollmar FSSP for cellular automata with broadcasting submitted for publication

    Google Scholar 

  15. A. Waksman An optimum solution to the firing squad synchronization problem Information and Control 9 (1966), 66–78

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Karlsruhe, D-7500, Karlsruhe, Federal Republic of Germany

    Roland Vollmar

Authors
  1. Roland Vollmar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. D. Becker I. Eisele F. W. Mündemann

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vollmar, R. (1991). Some remarks on synchronization problems. In: Becker, J.D., Eisele, I., Mündemann, F.W. (eds) Parallelism, Learning, Evolution. WOPPLOT 1989. Lecture Notes in Computer Science, vol 565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55027-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-55027-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55027-3

  • Online ISBN: 978-3-540-46663-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation