On the Complexity of Adding Convergence

This paper investigates the complexity of designing Self-Stabilizing (SS) distributed programs, where an SS program meets two properties, namely closure and convergence. Convergence requires that, from any state, the computations of an SS program reach a set of legitimate states (a.k.a. invariant). Upon reaching a legitimate state, the computations of an SS program remain in the set of legitimate states as long as no faults occur; i.e., Closure. We illustrate that, in general, the problem of augmenting a distributed program with convergence, i.e., adding convergence, is NP-complete (in the size of its state space). An implication of our NP-completeness result is the hardness of adding nonmasking fault tolerance to distributed programs, which has been an open problem for the past decade.

[1]  Ali Ebnenasir,et al.  A Lightweight Method for Automated Design of Convergence , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[2]  Anish Arora.  A foundation of fault-tolerant computing , 1992 .

[3]  Mohamed G. Gouda,et al.  The Triumph and Tribulation of System Stabilization , 1995, WDAG.

[4]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[5]  Anish Arora,et al.  Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance , 1998, IEEE Trans. Software Eng..

[6]  Ali Ebnenasir,et al.  Automatic synthesis of fault-tolerance , 2005 .

[7]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[8]  Arshad Jhumka,et al.  Automated design of efficient fail-safe fault tolerance , 2004 .

[9]  Nancy A. Lynch,et al.  Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Murat Demirbas,et al.  Convergence refinement , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[11]  Ali Ebnenasir,et al.  Swarm Synthesis of Convergence for Symmetric Protocols , 2012, 2012 Ninth European Dependable Computing Conference.

[12]  Mathai Joseph,et al.  Transformation of programs for fault-tolerance , 2005, Formal Aspects of Computing.

[13]  Neeraj Suri,et al.  An approach to synthesise safe systems , 2006, Int. J. Secur. Networks.

[14]  Anish Arora,et al.  Closure and Convergence: A Foundation of Fault-Tolerant Computing , 1993, IEEE Trans. Software Eng..

[15]  Borzoo Bonakdarpour,et al.  Revising Distributed UNITY Programs Is NP-Complete , 2008, OPODIS.

[16]  Borzoo Bonakdarpour,et al.  Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[17]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Ali Ebnenasir,et al.  Automated synthesis of multitolerance , 2004, International Conference on Dependable Systems and Networks, 2004.

[20]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[21]  Mohamed G. Gouda.  The Theory of Weak Stabilization , 2001, WSS.

[22]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[23]  Ali Ebnenasir,et al.  Complexity issues in automated synthesis of failsafe fault-tolerance , 2005, IEEE Transactions on Dependable and Secure Computing.

[24]  Fuad Abujarad,et al.  Automated constraint-based addition of nonmasking and stabilizing fault-tolerance , 2011, Theor. Comput. Sci..

[25]  Ali Ebnenasir,et al.  SAT-Based Synthesis of Fault-Tolerance 1 , .

[26]  Boaz Patt-Shamir,et al.  Self-stabilization by local checking and correction , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[27]  Anish Arora,et al.  Automating the Addition of Fault-Tolerance , 2000, FTRTFT.

[28]  George Varghese,et al.  Constraint satisfaction as a basis for designing nonmasking fault-tolerance , 1996, J. High Speed Networks.