Abstract
The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of FSSP algorithms has been proposed. Here we study the classical FSSP on a model of fault-tolerant cellular automata that might have possibly some defective cells and present the first state-efficient implementations of fault-tolerant FSSP algorithms for one-dimensional (1D) and two-dimensional (2D) arrays. It is shown that, under some constraints on the distribution and length of defective cells, any 1D cellular array of length n with p defective cell segments can be synchronized in \(2n-2+p\) steps and the algorithm is realized on a 1D cellular automaton with 164 states and 4792 transition rules. In addition, we give a smaller implementation for the 2D FSSP that can synchronize any 2D rectangular array of size \( m \times n\), including O(mn) rectangle-shaped isolated defective zones, exactly in \(2(m+n)-4\) steps on a cellular automaton with only 6 states and 939 transition rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Dimitriadis, A., Kutrib, M., Sirakoulis, G.C.: Cutting the firing squad synchronization. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds.) ACRI 2016. LNCS, vol. 9863, pp. 123–133. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44365-2_12
Gács, P.: Reliable computation with cellular automata. J. Comput. System Sci. 32, 15–78 (1986)
Kutrib, M., Vollmar, R.: The firing squad synchronization problem in defective cellular automata. IEICE Trans. Inf. Syst. E78–D(7), 895–900 (1995)
Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theor. Comput. Sci. 50, 183–238 (1987)
Moore, E.F.: The firing squad synchronization problem. In: Moore, E.F. (ed.) Sequential Machines, Selected Papers. Addison-Wesley, Reading, pp. 213–214 (1964)
Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. Inf. Syst. E87–D, 733–739 (2004)
Umeo, H., Maeda, M., Hisaoka, M., Teraoka, M.: A state-efficient mapping scheme for designing two-dimensional firing squad synchronization algorithms. Fundam. Inform. 74, 603–623 (2006)
Umeo, H.: Firing squad synchronization problem in cellular automata. In: Meyers, R. (ed.) Encyclopedia of Complexity and System Science, vol. 4, pp. 3537–3574. Springer, New York (2009). https://doi.org/10.1007/978-0-387-30440-3
Yunès, J.-B.: Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata. J. Cell. Autom. 1(3), 253–268 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Umeo, H., Kamikawa, N., Maeda, M., Fujita, G. (2018). Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-99813-8_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99812-1
Online ISBN: 978-3-319-99813-8
eBook Packages: Computer ScienceComputer Science (R0)