Illustrating the impossibility of crash-tolerant consensus in asynchronous systems

Authors:
Felix C. Freiling;Hagen Völzer
Affiliations:
University of Mannheim, Germany;University of Lübeck, Germany
Venue:
ACM SIGOPS Operating Systems Review
Year:
2006

Citing 9
Cited 3

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
The Many Faces of Consensus in Distributed Systems

Computer
The consensus problem in fault-tolerant computing

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)
Conditions on input vectors for consensus solvability in asynchronous distributed systems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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 constructive proof for FLP

Information Processing Letters

When consensus meets self-stabilization

Journal of Computer and System Sciences
The failure detector abstraction

ACM Computing Surveys (CSUR)
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

This exercise shows how a simple restricted algorithm can be used to present an introductory discussion on the crash-tolerant consensus problem in asynchronous distributed systems. This text is intended to support teaching the consensus problem in courses on distributed systems.