Why Logical Clocks are Easy
暂无分享,去创建一个
[1] Paulo Sérgio Almeida,et al. Scalable and Accurate Causality Tracking for Eventually Consistent Stores , 2014, DAIS.
[2] Sanjeev Kumar,et al. Challenges to Adopting Stronger Consistency at Scale , 2015, HotOS.
[3] Bernadette Charron-Bost,et al. Concerning the Size of Logical Clocks in Distributed Systems , 1991, Inf. Process. Lett..
[4] Michael J. Freedman,et al. Don't settle for eventual: scalable causal consistency for wide-area storage with COPS , 2011, SOSP.
[5] Friedemann Mattern,et al. Detecting causal relationships in distributed computations: In search of the holy grail , 1994, Distributed Computing.
[6] Justin Sheehy,et al. There is No Now , 2015, ACM Queue.
[7] Alley Stoughton,et al. Detection of Mutual Inconsistency in Distributed Systems , 1983, IEEE Transactions on Software Engineering.
[8] Kenneth P. Birman,et al. Reliable communication in the presence of failures , 1987, TOCS.
[9] Colin J. Fidge,et al. Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .
[10] Paulo Sérgio Almeida,et al. Brief announcement: efficient causality tracking in distributed storage systems with dotted version vectors , 2012, PODC '12.
[11] George Neville-Neil. Time is an Illusion. , 2015, ACM Queue.
[12] Friedemann Mattern,et al. Virtual Time and Global States of Distributed Systems , 2002 .
[13] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.