Skip to main content
SpringerLink
Log in

State-efficient realization of fault-tolerant FSSP algorithms

  • Published:
Natural Computing Aims and scope Submit manuscript

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) cellular arrays. It is shown that, under some constraints on the length and distribution 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 of length \(n, 2 \le n \le 50\), having 164 states and 4792 transition rules. In addition, we give by far a smaller-state implementation of a 2D FSSP algorithm that can synchronize any 2D rectangular array of size \(m \times n\), possibly including at most O(mn) isolated defective zones, exactly in \(2(m+n)-4\) steps on a cellular automaton with only 6 states and 935 transition rules.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Balzer R (1967) An 8-state minimal time solution to the firing squad synchronization problem. Inf Control 10:22–42

    Article  Google Scholar 

  • Burns JE, Lynch NA (1985) The Byzantine firing squad problem. Technical report of MIT, MIT/LCS/TM-275, 1–17

  • Coan BA, Dolev D, Dwork C, Stockmeyer L (1989) The distributed firing squad problem. SIAM J Comput 18:990–1012

    Article  MathSciNet  Google Scholar 

  • Dimitriadis A, Kutrib M, Sirakoulis GCh (2016) Cutting the firing squad synchronization. In: Proceedings of ACRI 2016, LNCS 9863, pp 123–133

  • Gács P (1986) Reliable computation with cellular automata. J Comput Syst Sci 32:15–78

    Article  MathSciNet  Google Scholar 

  • Gerken HD (1987) Über Synchronisations—Probleme bei Zellularautomaten. Diplomarbeit, Institut für Theoretische Informatik, Technische Universität Braunschweig

  • Goto E (1962) A minimal time solution of the firing squad problem. In: Dittoed course notes for applied mathematics, vol 298, Harvard University, pp 52–59

  • Harao M, Noguchi S (1975) Fault tolerant cellular automata. J Comput Syst. Sci 11:171–185

    Article  MathSciNet  Google Scholar 

  • Kutrib M, Löwe JT (2000) Fault tolerant parallel pattern recognition. In: Theoretical and practical issues on cellular automata (ACRI 2002), Springer, pp 72–80

  • Kutrib M, Vollmar R (1991) Minimal time synchronization in restricted defective cellular automata. J Inform Process Cybern ELK 27:179–196

    MATH  Google Scholar 

  • Kutrib M, Vollmar R (1995) The firing squad synchronization problem in defective cellular automata. IEICE Trans Inf Syst E78–D:895–900

    Google Scholar 

  • Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers, Califonia, ISBN 1-55860-348-4

  • Mazoyer J (1987) A six-state minimal time solution to the firing squad synchronization problem. Theor Comput Sci 50:183–238

    Article  MathSciNet  Google Scholar 

  • Moore EF (1964) The firing squad synchronization problem. In: Moore EF (ed) Sequential machines, selected papers, Addison-Wesley, Reading, MA, pp 213–214

  • Nishio H, Kobuchi H (1975) Fault tolerant cellular spaces. J Comput Syst. Sci 11:150–170

    Article  MathSciNet  Google Scholar 

  • Umeo H (2004) A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans Inf Syst E87–D:733–739

    Google Scholar 

  • Umeo H (2009) Firing squad synchronization problem in cellular automata. In: Meyers RA (ed) Encyclopedia of complexity and system science, vol 4, Springer, pp 3537–3574

  • Umeo H, Maeda M, Hisaoka M, Teraoka M (2006) A state-efficient mapping scheme for designing two-dimensional firing squad synchronization algorithms. Fund Inf 74:603–623

    MathSciNet  MATH  Google Scholar 

  • Umeo H, Kamikawa N, Maeda M, Fujita G (2018) Implementations of FSSP algorithms on fault-tolerant cellular arrays. In: Proceedings of ACRI 2018, LNCS, vol 11115, pp 274–285. https://doi.org/10.1007/978-3-319-99813-8-25

  • Waksman A (1966) An optimum solution to the firing squad synchronization problem. Inf Control 9:66–78

    Article  MathSciNet  Google Scholar 

  • Yunès J-B (2006) Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata. J Cell Autom 1:253–268

    MathSciNet  MATH  Google Scholar 

  • Zambonelli F, Mamei M, Roli A (2002) What can cellular automata tell us about the behavior of large multi-agent systems? In: Proceedings of SELMAS 2002, Springer, pp 216–231

Download references

Acknowledgements

A part of this work is supported by JSPS 16K00026. The authors would like to thank reviewers for many helpful comments and suggestions to improve the paper.

Author information

Authors and Affiliations

  1. University of Osaka Electro-Communication, Neyagawa-shi, Hastu-cho, 18-8, Osaka, 572-8530, Japan

    Hiroshi Umeo, Naoki Kamikawa, Masashi Maeda & Gen Fujita

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naoki Kamikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masashi Maeda
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gen Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroshi Umeo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A preliminary version of this work appeared at 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, held on 17–21, September, 2018, in Como, Italy.

Appendix

Appendix

Transition rule set for the 2D 6-state fault-tolerant FSSP algorithm

figure afigure a

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Umeo, H., Kamikawa, N., Maeda, M. et al. State-efficient realization of fault-tolerant FSSP algorithms. Nat Comput 18, 827–844 (2019). https://doi.org/10.1007/s11047-019-09765-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-019-09765-3

Keywords

Search

Navigation