A simple proof of the necessity of the failure detector Σ to implement an atomic register in asynchronous message-passing systems

Authors:
François Bonnet;Michel Raynal
Affiliations:
IRISA, Université de Rennes, 35042 Rennes Cedex, France;IRISA, Université de Rennes, 35042 Rennes Cedex, France
Venue:
Information Processing Letters
Year:
2010

Citing 10
Cited 5

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Efficient and robust sharing of memory in message-passing systems

Journal of Algorithms
Distributed Algorithms

Distributed Algorithms
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
The weakest failure detectors to solve certain fundamental problems in distributed computing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Asynchronous bounded lifetime failure detectors

Information Processing Letters

Anonymous asynchronous systems: the case of failure detectors

DISC'10 Proceedings of the 24th international conference on Distributed computing
(anti-Ωx × Σz)-based k-set agreement algorithms

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The weakest failure detector to implement a register in asynchronous systems with hybrid communication

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Relations linking failure detectors associated with k-set agreement in message-passing systems

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
The weakest failure detector to implement a register in asynchronous systems with hybrid communication

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper presents a simple proof that shows that the quorum failure detector class (denoted @S) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of process crashes. This proof is based on a new reduction algorithm in which all the variables are bounded.