A comparison of the Byzantine agreement problem and the transaction commit problem
Fault-tolerant distributed computing
On the relationship between the atomic commitment and consensus problems
Fault-tolerant distributed computing
Increasing the resilience of atomic commit, at no additional cost
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
Non-blocking atomic commitment
Distributed systems (2nd Ed.)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Encapsulating Failure Detection: From Crash to Byzantine Failures
Ada-Europe '02 Proceedings of the 7th Ada-Europe International Conference on Reliable Software Technologies
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
Managed Agreement: Generalizing two fundamental distributed agreement problems
Information Processing Letters
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Asynchronous bounded lifetime failure detectors
Information Processing Letters
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Modeling agreement problems in the universal composability framework
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Comparing the atomic commitment and consensus problems
Future directions in distributed computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
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
| Hi-index | 0.00 |
This paper addresses the Non-Blocking Atomic Commit (NB-AC) problem in asynchronous distributed systems augmented with failure detectors. We first show that, in these systems, NB-AC and Consensus are incomparable. Roughly speaking, there is a failure detector that solves NBAC but not Consensus and a failure detector that solves Consensus but not NB-AC. Then we introduce the Anonymously Perfect failure detector ?P. We show that, to solve NB-AC, ?P is necessary (while P is not), whereas ?P + ♦S is sufficient when a majority of the processes are correct. We draw from our results some observations on the practical solvability of NB-AC.