Concept

Replication (computing)

Related publications (218)

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.

A Formal Analysis of the Deferred Update Technique

Rodrigo Malta Schmidt, Fernando Pedone

The deferred update technique is a widely used approach for building replicated database systems. Its fame stems from the fact that read-only transactions can execute locally to any single database replica, providing good performance for workloads where tr ...

2007

A formal analysis of the deferred update technique

Rodrigo Malta Schmidt, Fernando Pedone

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2007

Tashkent+: Memory-Aware Load Balancing and Update Filtering in Replicated Databases

Willy Zwaenepoel, Sameh Mohamed Elnikety

BEST PAPER AWARDWe present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets of transactions to ...

2007

A High Throughput Atomic Storage Algorithm

Rachid Guerraoui, Dejan Kostic, Ron Levy

This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations, and even if there is contention, our algorithm has a high write throughput ...

2007

The Heard-Of Model: Computing in Distributed Systems with Benign Failures

André Schiper

Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: Degree of synchrony and failure model are two independent parameters that determine a particular type of system ...

2007

Implementing Joins using Extensible Pattern Matching

Philipp Haller

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementati ...

2007

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

Springer, Springer-Verlag2007

On Collision-fast Atomic Broadcast

Rodrigo Malta Schmidt, Fernando Pedone

Atomic Broadcast, an important abstraction in dependable distributed computing, is usually implemented by many instances of the well-known consensus problem. Some asynchronous consensus algorithms achieve the optimal latency of two (message) steps but cann ...

2007

Tashkent: Uniting Durability with Transaction Ordering for High-Performance Scalable Database Replication

Sameh Mohamed Elnikety, Fernando Pedone

In stand-alone databases, the functions of ordering the transaction commits and making the effects of transactions durable are performed in one single action, namely the writing of the commit record to disk. For efficiency many of these writes are grouped ...

2006