The inherent difficulty of timely primary-backup replication
暂无分享,去创建一个
[1] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[2] Nancy A. Lynch,et al. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.
[3] Kedar S. Namjoshi,et al. The inherent difficulty of timely primary-backup replication , 2011, PODC '11.
[4] K. Mani Chandy,et al. How processes learn , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
[5] Fred B. Schneider,et al. Replication management using the state-machine approach , 1993 .
[6] Edmund M. Clarke,et al. Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..
[7] Fred B. Schneider,et al. The primary-backup approach , 1993 .
[8] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[9] Farnam Jahanian,et al. A Real-Time Primary-Backup Replication Service , 1999, IEEE Trans. Parallel Distributed Syst..
[10] Dutch T. Meyer,et al. Remus: High Availability via Asynchronous Virtual Machine Replication. (Best Paper) , 2008, NSDI.