Non-blocking atomic commit in asynchronous distributed systems with failure detectors

Distributed Computing

Volumn 15, Issue 1, 2002, Pages 17-25

  Guerraoui, Rachid ^a  

^a EPFL   (Switzerland)

Author keywords

Asynchrony; Atomic commit; Consensus; Failure detection; Lower bound

Indexed keywords

COMPUTER SYSTEM RECOVERY; DISTRIBUTED DATABASE SYSTEMS; FAILURE ANALYSIS; SERVERS;

FAILURE DETECTORS;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 0036263931     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s446-002-8027-4     Document Type: Article

References (15)

1. Non-blocking atomic commitment
2. Unreliable failure detectors for reliable distributed systems
3. The weakest failure detector for solving consensus
4. Transaction commit in a realistic timing model
5. Impossibility of distributed consensus with one faulty process
6. About classes of problems in asynchronous distributed systems with process crashes
7. Revisiting the relationship between non-blocking atomic commitment and consensus
8. Indulgent algorithms
9. A comparison of the byzantine agreement problem and the transaction commit problem
10. On the relationship between the atomic commitment and consensus problems
11. The weak byzantine generals problem
12. Increasing the resilience of atomic commit, at no additional cost
13. NonBlocking commit protocols
14. A quorum-based commit protocol