Increasing the resilience of atomic commit, at no additional cost
暂无分享,去创建一个
[1] M. Herlihy. A quorum-consensus replication method for abstract data types , 1986, TOCS.
[2] Michael Stonebraker,et al. A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.
[3] David K. Gifford,et al. Weighted voting for replicated data , 1979, SOSP '79.
[4] Flaviu Cristian,et al. An efficient, fault-tolerant protocol for replicated data management , 1985, Fault-Tolerant Distributed Computing.
[5] Jim Gray,et al. Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.
[6] Hector Garcia-Molina,et al. Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.
[7] David Peleg,et al. The Availability of Quorum Systems , 1995, Inf. Comput..
[8] Dale Skeen,et al. A Quorum-Based Commit Protocol , 1982, Berkeley Workshop.
[9] Maurice Herlihy. Concurrency versus availability: atomicity mechanisms for replicated data , 1987, TOCS.
[10] Satish K. Tripathi,et al. A Fault-Tolerant Algorithm for Replicated Data Management , 1995, IEEE Trans. Parallel Distributed Syst..
[11] Francis Y. L. Chin,et al. Optimal termination protocols for network partitioning , 1983, PODS '83.
[12] Amr El Abbadi,et al. Maintaining availability in partitioned replicated databases , 1987, ACM Trans. Database Syst..
[13] Tiko Kameda,et al. Site optimal termination protocols for a distributed database under network partitioning , 1985, OPSR.
[14] Idit Keidar,et al. A Highly Available Paradigm for Consistent Object Replication , 1994 .
[15] CheungDavid,et al. Site optimal termination protocols for a distributed database under network partitioning , 1986 .