IEEE Transactions on Software Engineering
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
Optimistic atomic broadcast: a pragmatic viewpoint
Theoretical Computer Science - Special issue: Distributed computing
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA
IEEE Transactions on Dependable and Secure Computing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
The circular two-phase commit protocol
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Generating fast atomic commit from hyperfast consensus
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Dependable Systems
| Hi-index | 0.00 |
Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The cost for non-blocking implies however (1) a high number of messages and communication steps required to reach commit, and (2) a complicated termination protocol needed in the case of failure suspicions. In this paper, we present a non-blocking protocol, called MDSPC (Modular and Decentralized Three Phase Commit), which enables to trade resiliency against efficiency. As conveyed by our performance measures, MDSPC is faster than existing non-blocking protocols, and in the case of a broadcast network and a reasonable resiliency rate (e.g. 2 or 3) is almost as efficient as the classical (blocking) 2PC. The termination protocol of MDSPC is encapsulated inside a majority consensus protocol. This modularity leads to a simple structure of MDSPC and enables a precise characterization of its liveness in an asynchronous system with an unreliable failure detector.