Skip to main content
SpringerLink
Log in

A Class of Non-optimum-time FSSP Algorithms

  • Chapter
  • First Online:
Advances in Unconventional Computing

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 22))

Abstract

Synchronization of large-scale networks is an important and fundamental computing primitive in parallel and distributed systems. The synchronization in cellular automata, known as the firing squad synchronization problem (FSSP), has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms has been proposed. In the present chapter, we give a survey on a class of non-optimum-time 3n-step FSSP algorithms for synchronizing one-dimensional (1D) cellular automata of length n in \(3n \pm O(\log n)\) steps and present a comparative study of a relatively large-number of their implementations. We also propose two smallest-state, known at present, implementations of the 3n-step algorithm. This chapter gives the first complete transition rule sets implemented on finite state automata for the class of non-optimum-time 3n-step FSSP algorithms developed so far.

A part of this work has been presented at 13th International Conference on Parallel Computing Technologies, PaCT 2015 (chaired by Victor Malyshkin), held on Aug. 31–Sept. 4, 2015, in Petrozavodsk, Russia.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

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

    Article  Google Scholar 

  2. Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. ACM 12(3), 388–394 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  3. H.-D. Gerken: Uber Synchronisations-Probleme bei Zellularautomaten. pp. 50. Diplomarbeit Institut fur Theoretische Informatik, Technische Universitat Braunschweig, (1987)

    Google Scholar 

  4. E. Goto: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics vol. 298, pp. 52-59. Harvard University, (1962)

    Google Scholar 

  5. Herman, G.T.: Models for cellular interactions in development without polarity of individual cells. I. General description and the problem of universal computing ability. Int. J. Syst. Sci. 2(3), 271–289 (1971)

    Article  MATH  Google Scholar 

  6. Herman, G.T.: Models for cellular interactions in development without polarity of individual cells. II. Problems of synchronization and regulation. Int. J Syst. Sci. 3(2), 149–175 (1972)

    Article  MATH  Google Scholar 

  7. Kobuchi, Y.: A note on symmetrical cellular spaces. Inform. Process. Lett. 25, 413–415 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theor. Comput. Sci. 50, 183–238 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  11. W. L. Ng: Partial solutions for the firing squad synchronization problem on rings. pp.363. UMI Dissertation Publishing, Ann Arbor, MI (2011)

    Google Scholar 

  12. Sanders, P.: Massively parallel search for transition-tables of polyautomata. In: Jesshope, C., Jossifov, V., Wilhelmi, W. (eds.) Proceedings of the VI International Workshop on Parallel Processing by Cellular Automata and Arrays, pp. 99–108. Akademie (1994)

    Google Scholar 

  13. Szwerinski, H.: Symmetrical one-dimensional cellular spaces. Inform. Control 67, 163–172 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  14. H. Umeo: Firing squad synchronization problem in cellular automata. In: R. A. Meyers (Ed.) Encyclopedia of Complexity and System Science, vol.4, pp. 3537–3574. Springer, Heidelberg (2009)

    Google Scholar 

  15. Umeo, H., Kamikawa, N., Yunès, J.B.: A family of smallest symmetrical four-state firing squad synchronization protocols for ring arrays. Parallel Process. Lett. 19(2), 299–313 (2009)

    Article  MathSciNet  Google Scholar 

  16. Umeo, H., Maeda, M., Hongyo, K.: A design of symmetrical six-state \(3n\)-step firing squad synchronization algorithms and their implementations. Proceedings of 7th International Conference on Cellular Automata for Research and Industry, ACRI, LNCS vol. 4173, pp. 157-168.(2006)

    Google Scholar 

  17. Umeo, H., Maeda, M., Sousa, A., Taguchi, T.: A class of non-optimum-time \(3n\)-step FSSP algorithms-a survey. In: Proceedings of the 13th International Conference on Parallel Computing Technologies, PaCT: Petrozavodsk, LNCS, vol. 9251. pp. 231–245. Springer, Heidelberg (2015)

    Google Scholar 

  18. Umeo, H., Yanagihara, T.: A smallest five-state solution to the firing squad synchronization problem. In: Proceedings of 5th International Conference on Machines, Computations, and Universality, MCU, LNCS, vol. 4664 (2997), pp.292-302. (2007)

    Google Scholar 

  19. Umeo, H., Yunès, J.-B., Kamikawa, N., Kurashiki, J.: Small non-optimum-time firing squad synchronization protocols for one-dimensional rings. In: Proceedings of the 2009 International Symposium on Nonlinear Theory and its Applications, NOLTA’09, pp. 479–482. (2009)

    Google Scholar 

  20. Vollmar, R.: Some remarks about the “Efficiency” of polyautomata. Int. J. Theor. Phys. 21(12), 1007–1015 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  21. Waksman, A.: An optimum solution to the firing squad synchronization problem. Inf. Control 9, 66–78 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  22. Yunès, J.-B.: Seven states solutions to the firing squad synchronization problem. Theor. Comput. Sci. 127(2), 313–332 (1994)

    Article  MATH  Google Scholar 

  23. Yunès, J.-B.: An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem. Theor. Inf. Appl. 42(1), 55–68 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  24. Yunès, J.-B.: Simple new algorithms which solve the firing squad synchronization problem: a 7-state \(4n\)-step solution. In: Durand, J., Margenstern, M. (eds.) Proceedings of the International Conference on Machines, Computations, and Universality, MCU, LNCS, vol. 4664, pp.316–324. Springer, Berlin (2007)

    Google Scholar 

  25. J. B. Yunès: A 4-states algebraic solution to linear cellular automata synchronization. Inf. Process. Lett. 19(2), 71–75 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hiroshi Umeo

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroshi Umeo .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England Unconventional Computing Centre, Bristol, United Kingdom

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Umeo, H. (2017). A Class of Non-optimum-time FSSP Algorithms. In: Adamatzky, A. (eds) Advances in Unconventional Computing. Emergence, Complexity and Computation, vol 22. Springer, Cham. https://doi.org/10.1007/978-3-319-33924-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33924-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33923-8

  • Online ISBN: 978-3-319-33924-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation