Abstract
A new solution for the Firing Squad Synchronization Problem (FSSP) on two-dimensional square arrays is presented and its correctness is demonstrated in detail. Our new solution is time as well as communication optimal (the so-called minimal time 1-bit solution). In addition, it is shown that the technique developed and the results obtained allow also to solve in optimal time & communication FSSP for several other variants of this problem on networks shaped as square grids (with four Generals), square toruses and rings.
This research has been completed while the first author was visiting the Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno. Work partially supported by MIUR grant ex-60% 2003 Università di Salerno. The first author is also supported by the grant GAČR, 201/04/1153.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balzer, R.: An 8-states minimal time solution to the firing squad synchronization problem. Information and Control 10, 22–42 (1967)
Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters 30, 153–157 (1989)
Goto, E.: A Minimal Time Solution of the Firing Squad Problem. Lecture Notes for Applied Mathematics, vol. 298, pp. 52–59. Harvard University, Cambridge (1962)
Ilachinski, A.: Cellular Automata: A Discrete Universe. World Scientific, Singapore (2001)
Imai, K., Morita, K.: Firing squad synchronization problem in reversible cellular automata. Theoretical Computer Science 165, 475–482 (1996)
Imai, K., Morita, K., Sako, K.: Firing squad synchronization problem in number-conserving cellular automata. In: Proc. of the IFIP Workshop on Cellular Automata, Santiago, Chile (1998)
Kobayashy, K.: The Firing Squad Synchronization Problem for Two Dimensional Arrays. Information and Control 34, 153–157 (1977)
Kobayashy, K.: On Time Optimal Solutions of the Firing Squad Synchronization Problem for Two-Dimensional Paths. Theoretical Computer Science 259, 129–143 (2001)
La Torre, S., Parente, M.: Different Time Solutions for the Firing Squad Synchronization Problem on Various Networks, Tech. Rep. DIA - Università degli Studi di Salerno (2001)
Mazoyer, J.: A six states minimal time solution to the firing squad synchronization problem. Theoretical Computer Science 50, 183–238 (1987)
Mazoyer, J.: A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged, Laboratoire de l’Information du Parallelisme, Ecole Normale Superieure de Lyon, Rapport n.89-03 (April 1989)
Mazoyer, J.: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science 168(2), 367–404 (1996)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
Nishimura, J., Sogabe, T., Umeo, H.: A Design of Optimum-Time Firing Squad Synchronization Algorithm on 1-Bit Cellular Automaton Tech. Rep. of IPSJ (2000)
Roka, Z.: The Firing Squad Synchronization Problem on Cayley Graphs. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 402–411. Springer, Heidelberg (1995)
Shinar, I.: Two and Three-Dimensional Firing Squad Synchronization Problems. Information and Control 24, 163–180 (1974)
Szwerinski, H.: Time-Optimal 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)
Umeo, H., Michisaka, K., Kamikawa, N.: A Synchronization Problem on 1-Bit Communication Cellular Automata. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2657, pp. 492–500. Springer, Heidelberg (2003)
Waksman, A.: An optimum solution to the firing squad synchronization problem. Information and Control 9, 66–78 (1966)
Wolfram, S.: Cellular Automata and Complexity: Collected Papers. Wolfram Research Inc. (1994)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gruska, J., La Torre, S., Parente, M. (2004). Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)