Mastering Agreement Problems in Distributed Systems

Authors:
Michel Raynal;Mukesh Singhal
Affiliations:
-;-
Venue:
IEEE Software
Year:
2001

Citing 12
Cited 0

On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Understanding fault-tolerant distributed systems

Communications of the ACM
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)
Fault-tolerant broadcasts and related problems

Distributed systems (2nd Ed.)
Non-blocking atomic commitment

Distributed systems (2nd Ed.)
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonblocking atomic commitment is a well-known agreement problem of practical interest to distributed-systems engineers and designers. The authors present this problem as a case study in the context of synchronous and asynchronous distributed systems to survey recent notions about failure detection. They also show how systems engineers can use these findings to gain deeper insight into the challenges they encounter.