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

Noga Alon (1) , Hagit Attiya (2) , Shlomi Dolev (3) , Swan Dubois (4) , Maria Gradinariu Potop-Butucaru (4) , Sébastien Tixeuil (5, 6)

1 TAU - Tel Aviv University
2 Technion - Israel Institute of Technology [Haifa]
3 Department of Computer Science [Beer-Sheva]
4 Regal - Large-Scale Distributed Systems and Applications
5 IUF - Institut universitaire de France
6 NPA - Networks and Performance Analysis

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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu Potop-Butucaru, et al.. Pragmatic Self-Stabilization of Atomic Memory in Message-Passing Systems. SSS 2011 - 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Oct 2011, Grenoble, France. pp.19-31, ⟨10.1007/978-3-642-24550-3_4⟩. ⟨inria-00627780⟩