Generating fast atomic commit from hyperfast consensus

Authors:
Fabíola Gonçalves Pereira Greve;Jean-Pierre Le Narzul
Affiliations:
Computer Science Department, Federal University of Bahia, Brazil;GET/ENST-Bretagne, Cesson-Sévigné, France
Venue:
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Year:
2005

Citing 17
Cited 0

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)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Fault-tolerant broadcasts and related problems

Distributed systems (2nd Ed.)
The Generic Consensus Service

IEEE Transactions on Software Engineering
On the cost of fault-tolerant consensus when there are no faults: preliminary version

ACM SIGACT News
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Consensus in One Communication Step

PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
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
A Solution to Atomic Commitment Based on an Extended Consensus Protocol

FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
The Decentralized Non-Blocking Atomic Commitment Protocol

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Reducing the cost for non-blocking in atomic commitment

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Primary Component Asynchronous Group Membership as an Instance of a Generic Agreement Framework

ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Fast non-blocking atomic commit: an inherent trade-off

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work introduces a highly modular derivation of fast non-blocking atomic commit protocols. Modularity is achieved by the use of consensus protocols as completely independent services. Fast decision is obtained by the use of consensus protocols that decide in one communication step in good scenarios. Two original non-blocking atomic commit protocols are presented. One of the presented protocols outperforms existing equivalent solutions that are based on the use of failure detectors. In the presence of a low resiliency rate, f ≤ 1, it behaves as the classical 2PC and 3PC, exhibiting the same message complexities. In the general case, when one considers the number of tolerated crashes as f n/2, it exhibits a complexity of 2nf + 3n point to point messages. The best known algorithm exhibits a complexity of 4nf + 3n point to point messages.