Consistency without concurrency control in large, dynamic systems
暂无分享,去创建一个
[1] Leslie Lamport,et al. Consensus on transaction commit , 2004, TODS.
[2] Werner Vogels,et al. Dynamo: amazon's highly available key-value store , 2007, SOSP.
[3] Francisco Moura,et al. Using structural characteristics for autonomous operation , 1999, OPSR.
[4] Yasushi Saito,et al. Optimistic replication , 2005, CSUR.
[5] FCT-Universidade Nova de Lisboa. A commutative replicated data type for cooperative editing , 2009 .
[6] Robert Thomas,et al. Maintenance of duplicate databases , 1975, RFC.
[7] Fernando Pedone,et al. Optimal atomic broadcast and multicast algorithms for wide area networks , 2007, PODC '07.
[8] Idit Keidar,et al. Group communication specifications: a comprehensive study , 2001, CSUR.
[9] Nancy A. Lynch,et al. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.
[10] Pascal Molli,et al. Data consistency for P2P collaborative editing , 2006, CSCW '06.
[11] Michael Stonebraker,et al. A Formal Model of Crash Recovery in a Distributed System , 1983, IEEE Transactions on Software Engineering.
[12] Marc Shapiro,et al. Designing a commutative replicated data type , 2007, ArXiv.
[13] Leslie Lamport,et al. Generalized Consensus and Paxos , 2005 .
[14] Pascal Molli,et al. Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.