Reducing Storage for Quorum Consensus Algorithms
暂无分享,去创建一个
[1] Kenneth P. Birman,et al. Low cost management of replicated data in fault-tolerant distributed systems , 1986, TOCS.
[2] Meichun Hsu,et al. Two Pase Gossip: Managing Distributed Event Histories , 1989, Inf. Sci..
[3] Mostafa H. Ammar,et al. Performance Characterization of Quorum-Consensus Algorithms for Replicated Data , 1989, IEEE Trans. Software Eng..
[4] Jehan-François Pâris,et al. Voting with Witnesses: A Constistency Scheme for Replicated Files , 1986, ICDCS.
[5] Hector Garcia-Molina,et al. Consistency in a partitioned network: a survey , 1985, CSUR.
[6] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.
[7] Fred B. Schneider,et al. Synchronization in Distributed Programs , 1982, TOPL.
[8] LamportLeslie. Time, clocks, and the ordering of events in a distributed system , 1978 .
[9] David K. Gifford,et al. Weighted voting for replicated data , 1979, SOSP '79.
[10] Philip A. Bernstein,et al. The failure and recovery problem for replicated databases , 1983, PODC '83.
[11] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[12] Richard D. Schlichting,et al. Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.
[13] Philip A. Bernstein,et al. Concurrency Control in Distributed Database Systems , 1986, CSUR.
[14] Michael J. Fischer,et al. Sacrificing serializability to attain high availability of data in an unreliable network , 1982, PODS.
[15] Arthur J. Bernstein,et al. Efficient solutions to the replicated log and dictionary problems , 1984, PODC '84.