Publication

Early Consensus in an Asynchronous System with a Weak Failure Detector

Related publications (35)

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.

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

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

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

Effects of ‘Spatialized’ Communication in Tightly Coupled Work

Pierre Dillenbourg, Mauro Cherubini

This technical report describes the advancements on our research on collaborative annotations of maps. Particularly, we are trying to answer the following research question: does making explicit the location references of the elements of a discourse enhanc ...

2006

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes

André Schiper

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes Peter Urban and Andre Schiper Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While ...

2004

Comparing Distributed Consensus Algorithms

André Schiper

Peter Urban and Andre Schiper Comparing Distributed Consensus Algorithms Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze ...

2004

Evaluating the performance of distributed agreement algorithms

Nowadays, networked computers are present in most aspects of everyday life. Moreover, essential parts of society come to depend on distributed systems formed of networked computers, thus making such systems secure and fault tolerant is a top priority. If t ...

EPFL2003

Fast Indulgent Consensus with Zero Degradation

Rachid Guerraoui, Partha Dutta

This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail by crashing, and the detection of crashes are not reliable ...

2002

The VidTIMIT Database

This communication describes the multi-modal VidTIMIT database, which can be useful for research involving mono- or multi-modal speech recognition or person authentication. It is comprised of video and corresponding audio recordings of 43 volunteers, recit ...

IDIAP2002