Non-blocking atomic commit in asynchronous distributed systems with failure detectors
暂无分享,去创建一个
[1] Ozalp Babaoglu,et al. Non-blocking atomic commitment , 1993 .
[2] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[3] Dale Skeen,et al. Nonblocking commit protocols , 1981, SIGMOD '81.
[4] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[5] Leslie Lamport,et al. The Weak Byzantine Generals Problem , 1983, JACM.
[6] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[7] Michel Raynal,et al. On classes of problems in asynchronous distributed systems with process crashes , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).
[8] Vassos Hadzilacos,et al. On the Relationship Between the Atomic Commitment and Consensus Problems , 1990, Fault-Tolerant Distributed Computing.
[9] Jim Gray. A Comparison of the Byzantine Agreement Problem and the Transaction Commit Problem , 1986, Fault-Tolerant Distributed Computing.
[10] Rachid Guerraoui. On the hardness of failure-sensitive agreement problems , 2001, Inf. Process. Lett..
[11] Idit Keidar,et al. Increasing the resilience of atomic commit, at no additional cost , 1995, PODS '95.
[12] Rachid Guerraoui. Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus , 1995, WDAG.
[13] Sam Toueg,et al. The weakest failure detector for solving consensus , 1996, JACM.
[14] Dale Skeen,et al. A Quorum-Based Commit Protocol , 1982, Berkeley Workshop.
[15] Rachid Guerraoui,et al. Indulgent algorithms (preliminary version) , 2000, PODC '00.