Structuring computer-mediated communication systems to avoid information overload
Communications of the ACM
Partial orders for parallel debugging
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lazy replication: exploiting the semantics of distributed services
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
A response to Cheriton and Skeen's criticism of causal and totally ordered communication
ACM SIGOPS Operating Systems Review
Understanding the limitations of causally and totally ordered communication
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Eventually-serializable data services
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
Predicting response to political blog posts with topic models
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Unsupervised modeling of Twitter conversations
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
P-Store: Genuine Partial Replication in Wide Area Networks
SRDS '10 Proceedings of the 2010 29th IEEE Symposium on Reliable Distributed Systems
Measuring message propagation and social influence on Twitter.com
SocInfo'10 Proceedings of the Second international conference on Social informatics
Thread arcs: an email thread visualization
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Modeling the structure and evolution of discussion cascades
Proceedings of the 22nd ACM conference on Hypertext and hypermedia
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Transaction chains: achieving serializability with low latency in geo-distributed storage systems
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Proceedings of the 4th annual Symposium on Cloud Computing
Hi-index | 0.00 |
Causal consistency is the strongest consistency model that is available in the presence of partitions and provides useful semantics for human-facing distributed services. Here, we expose its serious and inherent scalability limitations due to write propagation requirements and traditional dependency tracking mechanisms. As an alternative to classic potential causality, we advocate the use of explicit causality, or application-defined happens-before relations. Explicit causality, a subset of potential causality, tracks only relevant dependencies and reduces several of the potential dangers of causal consistency.