Publication

The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit

Related publications (32)

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.

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers, significantly improving performance by avoiding I/O during the ex ...

2005

Fast Non-Blocking Atomic Commit: An Inherent Trade-off

Rachid Guerraoui, Bastian Pochon, Partha Dutta

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t > 3 an inherent trade-off between the fast abort property of N ...

2004

Reducing Fair Exchange to Atomic Commit

Rachid Guerraoui, Serge Vaudenay, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties.We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but ca ...

2004

Finally the Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui

Recent papers [GK03,HT03] define the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing and a majority of processes never crash. In this paper, we generalize t ...

2003

The Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui

This paper addresses the question of the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing. We define a failure detector, denoted by X, which we show to be su ...

2003

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Mac ...

2003

On the Weakest Failure Detector for Non-Blocking Atomic Commit.

Rachid Guerraoui

This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes detectors that provide information about gl ...

2002

On the Hardness of Failure-Sensitive Agreement Problems

Rachid Guerraoui

In [CT96], [FRT99], and [SM95], respectively, it was stated that the weakest failure detector for any of non-blocking atomic commit, terminating reliable broadcast and leader election, is the Perfect failure detector P. This paper presents a counter exampl ...

2000

Indulgent Algorithms

Rachid Guerraoui

Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterizes such algorithms and states some of their interesting featu ...

2000

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

1999