Publication

Improving Fast Paxos: being optimistic with no overhead

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 approach to fault tolerant distributed consensus

Rachele Fuzzati

The term distributed Consensus denotes the problem of getting a certain number of processes, that could be far away from each other and that exchange messages through some communication means, to all agree on the same value. This problem has been proved im ...

EPFL2008

A General Characterization of Indulgence

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract comput ...

2008

Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

André Schiper, Nils Richard Ekwall

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance o ...

Springer2007

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

The paper presents a primary-backup protocol to manage replicated in-memory database systems (IMDBs). The protocol exploits two features of IMDBs: coarse-grain concurrency control and deferred disk writes. Primary crashes are quickly detected by backups an ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

Considerations on the design of cut-and-cover tunnels

Aurelio Muttoni, Laurent Vulliet, Vincent Labiouse, Sylvain Plumey

The communication shows an alternative for introducing soil-structure interaction in the analysis of cut-and-cover tunnels. An uncoupled method is illustrated through two examples representative of the situations found in practice. The main features of eac ...

ELU-ULS 2006 - Symposium international sur les états limites ultimes des ouvrages géotechniques2006