Asynchronous bounded lifetime failure detectors

Authors:
Roy Friedman;Achour Mostefaoui;Michel Raynal
Affiliations:
Computer Science, Technion, Haifa, Israel;IRISA, Université de Rennes 1, France;IRISA, Université de Rennes 1, France
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 4

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)
The Timed Asynchronous Distributed System Model

IEEE Transactions on Parallel and Distributed Systems
On the Quality of Service of Failure Detectors

IEEE Transactions on Computers
Non-blocking atomic commit in asynchronous distributed systems with failure detectors

Distributed Computing
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

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

Information Processing Letters
Asynchronous Byzantine consensus with 2f+1 processes

Proceedings of the 2010 ACM Symposium on Applied Computing
Two abstractions for implementing atomic objects in dynamic systems

OPODIS'05 Proceedings of the 9th international conference on Principles 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

A failure detector provides processes with a single primitive that, each time it is invoked, returns to the invoking process information related to failures. This research note extends failure detectors by allowing processes to invoke an additional primitive whose effect is to limit the time scope of some properties offered by the failure detector. This simple addition makes possible to weaken the definition of failure detector classes without weakening their power. Two distributed computing problems are used to illustrate the benefit of such an approach, namely the consensus problem and the construction of an atomic register.