Concept

CAP theorem

Related publications (13)

Differentiated consistency for worldwide gossips

Eventual consistency is a consistency model that favors liveness over safety. It is often used in large-scale distributed systems where models ensuring a stronger safety incur performance that are too low to be deemed practical. Eventual consistency tends ...

2022

The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolation of ...

ASSOC COMPUTING MACHINERY2021

Bridging the Latency Gap between NVM and DRAM for Latency-bound Operations

Anastasia Ailamaki, Georgios Psaropoulos

Non-Volatile Memory (NVM) technologies exhibit 4× the read access latency of conventional DRAM. When the working set does not fit in the processor cache, this latency gap between DRAM and NVM leads to more than 2× runtime increase for queries dominated by ...

ACM2019

Monotonic Prefix Consistency in Distributed Systems

Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are alwa ...

2018

Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...

2018

Causal Consistency and Latency Optimality: Friend or Foe?

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

ASSOC COMPUTING MACHINERY2018

Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems

Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi

We study the issue of data consistency in highly-available distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is expected to be highly available. In such a ...

arxiv2017

, ,

Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency amo ...

2014

Consensus inside

Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David

ACM Press2014

Caching Dynamic Web Content: Designing and Analysing an Aspect-Oriented Solution

Willy Zwaenepoel, Sumit Mittal

Caching dynamic web content is an effective approach to reduce Internet latency and server load. An ideal caching solution is one that can be added transparently by the developers and provides complete consistency of the cached documents, while minimizing ...

2006

Graph Chatbot

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.