A weakest failure detector-based asynchronous consensus protocol for f

Authors:
Roy Friedman;Achour Mostefaoui;Michel Raynal
Affiliations:
IRISA, Université de Rennes 1, Campus de Beaulieu, 35042 Rennes cedex, France;IRISA, Université de Rennes 1, Campus de Beaulieu, 35042 Rennes cedex, France;IRISA, Université de Rennes 1, Campus de Beaulieu, 35042 Rennes cedex, France
Venue:
Information Processing Letters
Year:
2004

Citing 12
Cited 4

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
Impossibility of distributed consensus with one faulty process

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)
Reducing &OHgr; to ◊W

Information Processing Letters
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors

IEEE Transactions on Computers
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Failure Detection Lower Bounds on Registers and Consensus

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Realistic Look At Failure Detectors

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A weakest failure detector-based asynchronous consensus protocol for f

Information Processing Letters

A weakest failure detector-based asynchronous consensus protocol for f

Information Processing Letters
A short introduction to failure detectors for asynchronous distributed systems

ACM SIGACT News
The notion of veto number for distributed agreement problems

IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Building and using quorums despite any number of process of crashes

EDCC'05 Proceedings of the 5th European conference on Dependable Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Pf × ♦S has been shown to be the weakest realistic failure detector class needed to solve the consensus problem in an asynchronous distributed system prone to f process crashes in which communication is by message-passing. However. the only protocol that is known to meet this bound is based on three layers of protocol construction, and is therefore not efficient. This paper presents a surprisingly simple and very efficient direct message-passing implementation of a Pf × ♦S based consensus protocol, and proves its correctness.