Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Low-Latency Non-blocking Commit Service
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Fault-Tolerant Replication Management in Large-Scale Distributed Storage Systems
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Modular Composition and Verification of Transaction Processing Protocols
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Challenges in evaluating distributed algorithms
Future directions in distributed computing
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Non-blocking atomic commitment in asynchronous distributed systems with faulty processes
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Hi-index | 0.00 |
In a transactional system, an atomic commitment protocol ensures that for any transaction, all data managers agree on the same outcome: commit or abort. A non-blocking atomic commitment protocol enables an outcome to be decided at every correct data manager despite the failure of others. It is well known that the famous Two Phase Commit protocol (2PC) is a blocking protocol, whereas the Three Phase Commit protocol (2PC) is a non-blocking protocol. Both protocols are centralized. We discuss a Decentralized Non-Blocking Atomic Commitment protocol, named DNB-AC. In the absence of failures, the DNB-AC protocol requires the same number of steps to commit than the 2PC protocol (three steps). Performance measures show that the DNB-AC protocol is significantly faster that the 3PC and in the case of a broadcast network, is almost as efficient as the 2PC. The DNB-AC protocol uses a uniform consensus protocol as a termination protocol. Using the recent results by Chandra and Toueg (1991) on solving consensus in an asynchronous system augmented with unreliable failure detectors, we give a precise characterization of the liveness of DNB-AC. We show that DNB-AC is non-blocking when a majority of data managers are correct, and the failure detector is in the class OS.