• Publications
  • Influence
Communication-based prevention of useless checkpoints in distributed computations
Summary. A useless checkpoint is a local checkpoint that cannot be part of a consistent global checkpoint. This paper addresses the following problem. Given a set of processes that take (basic) localExpand
  • 90
  • 19
  • PDF
A communication-induced checkpointing protocol that ensures rollback-dependency trackability
TLDR
This paper develops a protocol that forces processes to take some additional local checkpoints (called forced checkpoints) in order that the resulting checkpoint and communication pattern satisfies the Rollback Dependency Trackability (RDT) property. Expand
  • 116
  • 14
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach
TLDR
This paper addresses the Consensus problem in asynchronous distributed systems (made of n processes, at most f of them may crash) equipped with unreliable failure detectors. Expand
  • 173
  • 12
  • PDF
Consensus in One Communication Step
TLDR
This paper presents a novel and surprisingly simple consensus protocol that allows processes to decide in a single communication step when “enough" processes propose the same value. Expand
  • 84
  • 12
Asynchronous implementation of failure detectors
TLDR
This paper proposes a new look at the implementation of failure detectors and more specifically at Chandra-Toueg’s failure detectors. Expand
  • 135
  • 11
  • PDF
Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages
TLDR
This paper presents a new round-based asynchronous consensus algorithm that copes with up to t<n/3 Byzantine processes, where n is the total number of processes. Expand
  • 53
  • 10
  • PDF
Fault-tolerant Total Order Multicast to asynchronous groups
TLDR
We propose a protocol for Total Order Multicast to Multiple Groups in the context of asynchronous distributed systems prone to process crash failures. Expand
  • 56
  • 8
  • PDF
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
TLDR
This article is on broadcast and agreement in asynchronous message-passing systems made up of n processes, and where up to t processes may have a Byzantine Behavior. Expand
  • 41
  • 8
  • PDF
Evaluating the condition-based approach to solve consensus
TLDR
Several approaches have been proposed to circumvent the impossibility to solve consensus in asynchronous distributed systems prone to process crash failures. Expand
  • 25
  • 7
  • PDF
From static distributed systems to dynamic systems
TLDR
A noteworthy advance in distributed computing is due to the recent development of peer-to-peer systems. Expand
  • 73
  • 6
  • PDF