Skip to main content
SpringerLink
Log in

A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation

  • Conference paper
Book cover Natural Computing

Part of the book series: Proceedings in Information and Communications Technology ((PICT,volume 2))

  • 794 Accesses

Abstract

The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m ×n with a general at one corner in m + n + max (m, n) − 3 steps. An implementation for the algorithm in terms of local transition rules is also given.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control 10, 22–42 (1967)

    Article  Google Scholar 

  2. Beyer, W.T.: Recognition of topological invariants by iterative arrays. Ph.D. Thesis, p. 144. MIT (1969)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  5. Grasselli, A.: Synchronization of cellular arrays: The firing squad problem in two dimensions. Information and Control 28, 113–124 (1975)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. Schmid, H.: Synchronisationsprobleme für zelluläre Automaten mit mehreren Generälen. Diplomarbeit, Universität Karsruhe (2003)

    Google Scholar 

  9. Shinahr, I.: Two- and three-dimensional firing squad synchronization problems. Information and Control 24, 163–180 (1974)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. on Information and Systems E87-D(3), 733–739 (2004)

    Google Scholar 

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

    Google Scholar 

  13. Umeo, H., Hisaoka, M., Akiguchi, S.: Twelve-state optimum-time synchronization algorithm for two-dimensional rectangular cellular arrays. In: Calude, C.S., Dinneen, M.J., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 214–223. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Umeo, H., Hisaoka, M., Sogabe, T.: A survey on optimum-time firing squad synchronization algorithms for one-dimensional cellular automata. Intern. J. of Unconventional Computing 1, 403–426 (2005)

    Google Scholar 

  15. Umeo, H., Hisaoka, M., Teraoka, M., Maeda, M.: Several new generalized linear- and optimum-time synchronization algorithms for two-dimensional rectangular arrays. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 223–232. Springer, Heidelberg (2005)

    Google Scholar 

  16. Umeo, H., Maeda, M., Hisaoka, M., Teraoka, M.: A state-efficient mapping scheme for designing two-dimensional firing squad synchronization algorithms. Fundamenta Informaticae 74, 603–623 (2006)

    MathSciNet  MATH  Google Scholar 

  17. Umeo, H., Uchino, H.: A new time-optimum synchronization algorithm for rectangle arrays. Fundamenta Informaticae 87(2), 155–164 (2008)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  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 & Takuya Yamawaki

  2. LIAFA - Universite Paris 7 Denis Diderot, 175, rue du chevaleret, 75013, Paris, France

    Jean-Baptiste Yunès

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Baptiste Yunès
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takuya Yamawaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Institute of Information and Communications Technology, Japan

    F. Peper

  2. Osaka Electro-Communications University, Japan

    H. Umeo

  3. University of Hyogo, Japan

    N. Matsui  & T. Isokawa  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Tokyo

About this paper

Cite this paper

Umeo, H., Yunès, JB., Yamawaki, T. (2010). A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds) Natural Computing. Proceedings in Information and Communications Technology, vol 2. Springer, Tokyo. https://doi.org/10.1007/978-4-431-53868-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-53868-4_39

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-53867-7

  • Online ISBN: 978-4-431-53868-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation