Scalable Causal Consistency, and Boosting of Learning Algorithms

Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS

https://www.cs.cmu.edu/~dga/papers/cops-sosp2011.pdf

Michael Perry will present a discussion on causal consistency in a distributed system. With this concept, a distributed system achieve:

• Low latency

• High availability

• Partition Tolerance

• Scalability

Most systems that do so sacrifice consistency (liniearizability of events) for eventual consistency. But this paper seeks a lesser compromise, which can easily detect and resolve conflicts.

As an added bonus, before the primary discussion, Dal will present a lightning talk on boosting of machine learning algorithms.