Publication

Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms (extended version)

Publications associées (33)

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Rachid Guerraoui, Andrei Kucharavy, Matteo Monti

Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms but also to a drastic increase in computational power used to train them.|S ...

New York2023

The Impact of RDMA on Agreement

Rachid Guerraoui, Mihail Igor Zablotchi, Naama Ben David

Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mechanism to control access permissions. In this paper, we study the fundamenta ...

2019

Never Say Never Probabilistic & Temporal Failure Detectors (Extended)

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building b ...

IPDPS2016

Never Say Never Probabilistic & Temporal Failure Detectors

Rachid Guerraoui, David Kozhaya

Ieee2016

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely

We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...

2013

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Zarko Milosevic

We become increasingly dependent on online services; therefore, their availability and correct behavior become increasingly important. Software replication is a popular technique for ensuring that computer systems continue to provide a correct service even ...

EPFL2013

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...

2012

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Fatemeh Borran

Fault-tolerant computing is the art and science of building computer systems that continue to operate normally in the presence of faults. The fault tolerance field covers a wide spectrum of research area ranging from computer hardware to computer software. ...

EPFL2011

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

2011

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search