Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays

• Published in: Cellular Automata Vol. 11115; pp. 274 - 285
• Main Authors: Umeo, Hiroshi, Kamikawa, Naoki, Maeda, Masashi, Fujita, Gen
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2018; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 9783319998121; 3319998129
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-99813-8_25

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.