Lecture

Eventual Consistency: Principles of Reactive Programming

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the concept of eventual consistency in distributed systems, contrasting it with strong and weak consistency models. It explains how eventual consistency allows for updates to propagate over time, ensuring that all reads return the last written value. The instructor discusses the implementation of an eventually consistent store using actors in Scala, emphasizing the importance of suitable data structures like CRDTs. An example data structure, the cluster membership state, is presented as a convergent data type with conflict resolution mechanisms. The lecture provides insights into the challenges of achieving eventual consistency in distributed systems.

Official source

Related concepts (29)

Consistency

In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if it has a model, i.e., there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead.

Consistency model

In computer science, a consistency model specifies a contract between the programmer and a system, wherein the system guarantees that if the programmer follows the rules for operations on memory, memory will be consistent and the results of reading, writing, or updating memory will be predictable. Consistency models are used in distributed systems like distributed shared memory systems or distributed data stores (such as s, databases, optimistic replication systems or web caching).

Gentzen's consistency proof

Gentzen's consistency proof is a result of proof theory in mathematical logic, published by Gerhard Gentzen in 1936. It shows that the Peano axioms of first-order arithmetic do not contain a contradiction (i.e. are "consistent"), as long as a certain other system used in the proof does not contain any contradictions either. This other system, today called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite induction up to the ordinal ε0", is neither weaker nor stronger than the system of Peano axioms.

Apache Cassandra

Cassandra is a free and open-source, distributed, wide-column store, NoSQL database management system designed to handle large amounts of data across many commodity servers, providing high availability with no single point of failure. Cassandra offers support for clusters spanning multiple datacenters, with asynchronous masterless replication allowing low latency operations for all clients. Cassandra was designed to implement a combination of Amazon's Dynamo distributed storage and replication techniques combined with Google's Bigtable data and storage engine model.

NoSQL

A NoSQL (originally referring to "non-SQL" or "non-relational") database provides a mechanism for storage and retrieval of data that is modeled in means other than the tabular relations used in relational databases. Such databases have existed since the late 1960s, but the name "NoSQL" was only coined in the early 21st century, triggered by the needs of Web 2.0 companies. NoSQL databases are increasingly used in big data and real-time web applications.

Related lectures (9)

NoSQL Databases: Origins and Types MOOC: Geographical Information Systems 1

Covers the origins and types of NoSQL databases, focusing on MongoDB and CRUD operations.

Eventual Consistency: NoSQL, CAP Theorem, and BASE

Explores NoSQL databases, CAP theorem, BASE principles, and eventual consistency in distributed systems.

Eventual Consistency: Actors and Data Structures

Explores eventual consistency, actors in Scala, and the importance of suitable data structures for achieving consistency in distributed systems.

Distributed Transactions: Architectures and Protocols

Explores parallel database architectures and distributed transaction protocols, focusing on coordination, concurrency control, and recovery challenges.

Eventual Consistency