Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
In this paper we present a survey on the minimum and non minimum time solutions to the Firing Squad Synchronization Problem. Particular emphasis is on the contribution given by Jozef Gruska, in honor of which this article is dedicated.
The problem consists in synchronizing a Cellular Automata (CA) whose cells work at discrete steps at unison. The first cell is initially in a particular state, called the General, and all the others are in a Latent state. The problem is solved when, all the cells enter for the first time and simultaneously a Firing state. In its original and basic formulation, the cells are arranged as a line, here we consider also other shapes like rings, rectangular grids and toruses. Also other variations of the problem are considered, such as the limited link capacitiesand different numbers and positions of the General state.
We consider both the minimum time needed to synchronize the CA and some algorithms synchronizing in particular times. Some open problems are also proposed.
KeywordsFSSP Cellular Automata Synchronous Computations Channel Capacity
Unable to display preview. Download preview PDF.
- [Bey69]Beyer, W.T.: Recognition of topological invariants by iterative arrays. PhD thesis, Massahcusetts Institute of Technology (1969).Google Scholar
- [Got62]Goto, E.: A minimum time solution of the firing squad problem. In: Course Notes for Applied Mathematics 298, Harvard University, pp. 52–59 (1962).Google Scholar
- [Ros13]Rosenberg, A.L.: Finite-state robots in a warehouse: Achieving linear parallel speedup while rearranging objects. In: Parallel Processing (ICPP), 2013 42nd International Conference on, pp. 379–388. IEEE (2013).Google Scholar
- [San94]Sanders, P.: Massively parallel search for transition-tables of polyautomata. In: Parcella, pp. 99–108 (1994).Google Scholar
- [SW04]Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional ca. In: Exploring New Frontiers of Theor. Inf., IFIP (TCS2004), pp. 111–124. Kluwer (2004).Google Scholar
- [Ume96]Umeo, H.: A note on firing squad synchronization algorithms. In: Worsch, T., Kutrib, M., (ed.), IFIP Cellular Automata Workshop 96, pp. 65 (1996).Google Scholar
- [UMK03]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, Part I. LNCS, vol. 2657, pp. 492–500. Springer, Heidelberg (2003)CrossRefGoogle Scholar
- [UNK12]Umeo, H., Nishide, K., Kubo, K.: A simple optimum-time fssp algorithm for multi-dimensional cellular automata. In: 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, AUTOMATA & JAC, volume 90 of EPTCS, pp. 151–165 (2012)Google Scholar
- [UUN11]Umeo, H., Uchino, H., Nomura, A.: How to synchronize square arrays in optimum-time - a new square synchronization algorithm. In: International Conference on High Performance Computing & Simulation, HPCS, pp. 801–807. IEEE (2011).Google Scholar