Pragmatic self-stabilization of atomic memory in message-passing systems

Authors:
Noga Alon;Hagit Attiya;Shlomi Dolev;Swan Dubois;Maria Potop-Butucaru;Sébastien Tixeuil
Affiliations:
Sackler School of Mathematics and Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel;Department of Computer Science, Technion, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;LIP6, Universite Pierre et Marie Curie, Paris 6/INRIA, France;LIP6, Universite Pierre et Marie Curie, Paris 6/INRIA, France;LIP6, Universite Pierre et Marie Curie, Paris 6/INRIA, France
Venue:
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Year:
2011

Citing 18
Cited 0

Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Bounded Concurrent Time-Stamping

SIAM Journal on Computing
Resource Bounds for Self-Stabilizing Message-Driven Protocols

SIAM Journal on Computing
Crash Resilient Communication in Dynamic Networks

IEEE Transactions on Computers
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Self-stabilization

Self-stabilization
Self-Stabilization by Local Checking and Global Reset (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing timestamps

Theoretical Computer Science
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Bounded time-stamps

Distributed Computing
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm

Theoretical Computer Science
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Implementing a Register in a Dynamic Distributed System

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Safe and Eventually Safe: Comparing Self-stabilizing and Non-stabilizing Algorithms on a Common Ground

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Spanders: distributed spanning expanders

Proceedings of the 2010 ACM Symposium on Applied Computing
Stabilizing data-link over non-FIFO channels with optimal fault-resilience

Information Processing Letters
When consensus meets self-stabilization

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.