Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems

A fault-tolerant and stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a pragmatic manner, by reaching a long execution in which it runs correctly. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme accommodating arbitrary labels, including those not generated by the scheme itself.

[1]  Amos Israeli,et al.  Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Jennifer L. Welch,et al.  Crash Resilient Communication in Dynamic Networks , 1997, IEEE Trans. Computers.

[3]  Shlomi Dolev,et al.  Spanders: distributed spanning expanders , 2010, SAC '10.

[4]  Shlomi Dolev,et al.  Empire of colonies: Self-stabilizing and self-organizing distributed algorithm , 2009, Theor. Comput. Sci..

[5]  Hagit Attiya.  Robust Simulation of Shared Memory: 20 Years After , 2010, Bull. EATCS.

[6]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[7]  Boaz Patt-Shamir,et al.  Bounding the Unbounded. , 1994, INFOCOM 1994.

[8]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[9]  Marcos K. Aguilera,et al.  Distributed Computing and Networking , 2011, Lecture Notes in Computer Science.

[10]  Shlomi Dolev,et al.  Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground , 2009, OPODIS.

[11]  Amos Israeli,et al.  Resource Bounds for Self-Stabilizing Message-Driven Protocols , 1997, SIAM J. Comput..

[12]  Sébastien Tixeuil,et al.  Self-Stabilizing Systems , 2003, Lecture Notes in Computer Science.

[13]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[14]  Lisa Higham,et al.  Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks , 2009, ICDCN.

[15]  Shlomi Dolev,et al.  Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments , 2001, WSS.

[16]  Maria Gradinariu Potop-Butucaru,et al.  Stabilizing data-link over non-FIFO channels with optimal fault-resilience , 2010, Inf. Process. Lett..

[17]  Shlomi Dolev,et al.  When Consensus Meets Self-stabilization , 2006, OPODIS.

[18]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[19]  Anne-Marie Kermarrec,et al.  Implementing a Register in a Dynamic Distributed System , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[20]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[21]  Boaz Patt-Shamir,et al.  Self-Stabilization by Local Checking and Global Reset (Extended Abstract) , 1994, WDAG.

[22]  Uri Abraham,et al.  Self-stabilizing timestamps , 2003, Theor. Comput. Sci..

[23]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[24]  Nir Shavit,et al.  Bounded Concurrent Time-Stamping , 1997, SIAM J. Comput..