Non-blocking atomic commitment in asynchronous distributed systems with faulty processes

Authors:
Sung-Hoon Park;Seon-Hyong Lee
Affiliations:
School of Electrical and Computer Engineering, Chungbuk National Unvi., Cheongju, ChungBuk, Korea;School of Electrical and Computer Engineering, Chungbuk National Unvi., Cheongju, ChungBuk, Korea
Venue:
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Year:
2012

Citing 14
Cited 0

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
A comparison of the Byzantine agreement problem and the transaction commit problem

Fault-tolerant distributed computing
A simple model for agreement in distributed systems

Fault-tolerant distributed computing
On the relationship between the atomic commitment and consensus problems

Fault-tolerant distributed computing
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.)
Nonblocking commit protocols

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Primary Partition "Virtually-Synchronous Communication" harder than Consensus

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Transaction Model vs. Virtual Synchrony Model: Bridging the Gap

Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
The Decentralized Non-Blocking Atomic Commitment Protocol

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Non blocking atomic commitment with an unreliable failure detector

SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Election Vs. Consensus in Asynchronous Systems

Election Vs. Consensus in Asynchronous Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper defines the Non-Blocking Atomic Commitment problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by M*, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ◇P. The paper shows that at any environment, the problem is solvable with M*.