Consistency in Scalable Systems

While eventual consistency is the general consistency guarantee ensured in cloud environments, stronger guarantees are in fact achievable. We show how scalable and highly available systems can provide processor, causal, sequential and session consistency during normal functioning. Failures and network partitions negatively affect consistency and generate divergence. After the failure or the partition, reconciliation techniques allow the system to restore consistency.

[1]  Pat Helland,et al.  Building on Quicksand , 2009, CIDR.

[2]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[3]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

[4]  André Schiper,et al.  Comparison of database replication techniques based on total order broadcast , 2005, IEEE Transactions on Knowledge and Data Engineering.

[5]  Fred B. Schneider,et al.  The primary-backup approach , 1993 .

[6]  Mustaque Ahamad,et al.  Slow memory: weakening consistency to enhance concurrency in distributed shared memories , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[7]  James R. Goodman,et al.  Cache Consistency and Sequential Consistency , 1991 .

[8]  David Mosberger,et al.  Memory consistency models , 1993, OPSR.

[9]  Werner Vogels,et al.  Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability. , 2022 .

[10]  Kenneth Salem,et al.  Lazy database replication with ordering guarantees , 2004, Proceedings. 20th International Conference on Data Engineering.

[11]  Antonio Fernández,et al.  Interconnection of distributed memory models , 2009, J. Parallel Distributed Comput..

[12]  Eric A. Brewer,et al.  Towards robust distributed systems (abstract) , 2000, PODC '00.

[13]  Farnam Jahanian,et al.  The inter-group router approach to scalable group composition , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[14]  Brian N. Bershad,et al.  The Midway distributed shared memory system , 1993, Digest of Papers. Compcon Spring.

[15]  Sape J. Mullender,et al.  Distributed systems (2nd Ed.) , 1993 .

[16]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[17]  Yawei Li,et al.  Megastore: Providing Scalable, Highly Available Storage for Interactive Services , 2011, CIDR.

[18]  Marvin Theimer,et al.  Session guarantees for weakly consistent replicated data , 1994, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems.

[19]  Antonio Fernández,et al.  On the interconnection of causal memory systems , 2004, J. Parallel Distributed Comput..

[20]  Rida A. Bazzi,et al.  The power of processor consistency , 1993, SPAA '93.

[21]  Kenneth Salem,et al.  Lazy database replication with snapshot isolation , 2006, VLDB.

[22]  Antonio Fernández,et al.  On the interconnection of message passing systems , 2008, Inf. Process. Lett..

[23]  Gustavo Alonso,et al.  Consistency Rationing in the Cloud: Pay only when it matters , 2009, Proc. VLDB Endow..

[24]  Nigel Ellis,et al.  Extreme scale with full SQL language support in microsoft SQL Azure , 2010, SIGMOD Conference.

[25]  Michael Stonebraker,et al.  The End of an Architectural Era (It's Time for a Complete Rewrite) , 2007, VLDB.

[26]  Hans-Arno Jacobsen,et al.  PNUTS: Yahoo!'s hosted data serving platform , 2008, Proc. VLDB Endow..

[27]  Camino de Vera,et al.  Refinement of the One-Copy Serializable Correctness Criterion , 2011 .

[28]  Philip A. Bernstein,et al.  Hyder - A Transactional Record Manager for Shared Flash , 2011, CIDR.

[29]  Roberto Beraldi,et al.  The hierarchical daisy architecture for causal delivery , 1999, Distributed Syst. Eng..

[30]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.