Skip to main content
SpringerLink
Log in

A Comparative Investigation into Optimum-Time Synchronization Protocols for a Large Scale of One-Dimensional Cellular Automata

  • Conference paper
  • First Online:
Book cover Parallel and Distributed Processing and Applications (ISPA 2003)

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

  • 347 Accesses

Abstract

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata. We show that the first transition rule set designed by Waksman [18] includes fundamental errors which cause unsuccessful firings and that ninety-three percent of the rules are redundant. In addition, the transition rule sets reported by [1], [2] and [6] are found to include several redundant rules. We also present herein a survey and a comparison of the quantitative aspects of the optimumtime synchronization algorithms developed thus far for one-dimensional cellular arrays.

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. R. Balzer: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control, vol. 10 (1967), pp. 22–42.

    Article  Google Scholar 

  2. Hans-D., Gerken: Über Synchronisations-Probleme bei Zellularautomaten. Diplomarbeit, Institut für Theoretische Informatik, Technische Universität Braunschweig, (1987), pp. 50.

    Google Scholar 

  3. E. Goto: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics 298, Harvard University, (1962), pp. 52–59, with an illustration in color.

    Google Scholar 

  4. E. Goto: Some puzzles on automata. in Toward computer sciences (T. Kitagawa ed.), Kyouritsu, (1966), pp. 67–91.

    Google Scholar 

  5. J. Mazoyer: An overview of the firing squad synchronization problem. Lecture Notes on Computer Science, Springer-Verlag, vol. 316 (1986), pp. 82–93.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Mazoyer: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science, vol. 168 (1996), pp. 367–404.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Mazoyer: A minimal-time solution to the FSSP without recursive call to itself and with bounded slope of signals. Draft version, (1997), pp. 8.

    Google Scholar 

  9. M. Minsky: Computation: Finite and infinite machines. Prentice Hall, (1967), pp. 28–29.

    Google Scholar 

  10. E. F. Moore: The firing squad synchronization problem. in Sequential Machines, Selected Papers (E. F. Moore, ed.), Addison-Wesley, Reading MA., (1964), pp. 213–214.

    Google Scholar 

  11. J. Nishimura, T. Sogabe and H. Umeo: A design of optimum-time firing squad synchronization algorithm on 1-bit cellular automaton. Proc. of the 8th International Symposium on Artificial Life and Robotics, Vol.2 (2003), pp. 381–386.

    Google Scholar 

  12. H. Umeo: A note on firing squad synchronization algorithms-A reconstruction of Goto’s first-in-the-world optimum-time firing squad synchronization algorithm. Proc. of Cellular Automata Workshop, M. Kutrib and T. Worsch (eds.), (1996), pp. 65.

    Google Scholar 

  13. H. Umeo and N. Kamikawa: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundamenta Informaticae, 52 (2002), pp. 257–275.

    MATH  MathSciNet  Google Scholar 

  14. H. Umeo, J. Nishimura and T. Sogabe: 1-bit inter-cell communication cellular algorithms (invited lecture). Proc. of the Tenth Intern. Colloquium on Differential Equations, held in Plovdiv in 1999, International Journal of Differential Equations and Applications, vol. 1A, no. 4 (2000), pp. 433–446.

    MATH  MathSciNet  Google Scholar 

  15. H. Umeo, T. Sogabe and Y. Nomura: Correction, optimization and verification of transition rule set for Waksman’s firing squad synchronization algorithm. Proc. of the Fourth Intern. Conference on Cellular Automata for Research and Industry, Springer, (2000), pp. 152–160.

    Google Scholar 

  16. R. Vollmar: Algorithmen in Zellularautomaten. Teubner, (1979), pp. 192.

    Google Scholar 

  17. R. Vollmar: Some remarks about the “Efficiency” of polyautomata. International Journal of Theoretical Physics, vol. 21, no. 12 (1982), pp. 1007–1015.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. of Osaka Electro-Communication, Neyagawa-shi, Hastu-cho, 18-8, Osaka, 572-8530, Japan

    Hiroshi Umeo & Masaya Hisaoka

  2. Internet Initiative Japan Inc., Chiyoda-ku Kanda, Nishiki-cho, 3-13, Tokyo, 101-0054, Japan

    Takashi Sogabe

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masaya Hisaoka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takashi Sogabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, 965-8580, Japan

    Minyi Guo

  2. Department of Computer Science, St. Francis Xavier University, Antigonish, NS, B2G 2W5, Canada

    Laurence Tianruo Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umeo, H., Hisaoka, M., Sogabe, T. (2003). A Comparative Investigation into Optimum-Time Synchronization Protocols for a Large Scale of One-Dimensional Cellular Automata. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-37619-4_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40523-8

  • Online ISBN: 978-3-540-37619-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation