Skip to main content

Recent Developments in Constructing Square Synchronizers

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7495)

Abstract

The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than fifty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we focus our attention to two-dimensional square synchronizers that can synchronize square arrays and construct a survey on recent developments in their designs and implementations of optimum-time synchronization algorithms for square arrays. A new generalized square synchronization algorithm with an initial general at any position is also presented.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about 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)

    CrossRef  Google Scholar 

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

    Google Scholar 

  3. Goto, E.: 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 

  4. Gruska, J., Torre, S.L., Parente, M.: The firing squad synchronization problem on squares, toruses and rings. Intern. J. of Foundations of Computer Science 18(3), 637–654 (2007)

    CrossRef  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. 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 

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

    Google Scholar 

  8. Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Proc. of IFIP World Congress, pp. 111–124 (2004)

    Google Scholar 

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

    CrossRef  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)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. La Torre, S., Napoli, M., Parente, M.: Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 264–275. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  12. Umeo, H.: Firing squad synchronization algorithms for two-dimensional cellular automata. Journal of Cellular Automata 4, 1–20 (2008)

    MathSciNet  Google Scholar 

  13. 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 (2009)

    Google Scholar 

  14. Umeo, H., Hisaoka, M., Akiguchi, S.: A 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)

    CrossRef  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)

    CrossRef  Google Scholar 

  16. Umeo, H., Kubo, K.: A Seven-State Time-Optimum Square Synchronizer. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 219–230. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  17. 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 

  18. Umeo, H., Nishide, K., Yamawaki, T.: A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 290–299. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  20. Umeo, H., Uchino, H., Nomura, A.: How to synchronize square arrays in optimum-time. In: Proc. of the 2011 International Conference on High Performance Computing and Simulation (HPCS 2011), pp. 801–807. IEEE (2011)

    Google Scholar 

  21. Umeo, H., Yanagihara, T.: Smallest Implementations of Optimum-Time Firing Squad Synchronization Algorithms for One-Bit-Communication Cellular Automata. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 210–223. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umeo, H., Kubo, K. (2012). Recent Developments in Constructing Square Synchronizers. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)