• 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
  • 91
  • 18
  • PDF
The Causal Ordering Abstraction and a Simple Way to Implement it
TLDR
A new message ordering relation, known as causal ordering, has been introduced by Birman and Joseph. Expand
  • 249
  • 17
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
  • 115
  • 13
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
A Contention-Friendly Binary Search Tree
TLDR
We propose a new lock-based concurrent binary tree using a methodology for writing concurrent data structures. Expand
  • 49
  • 12
  • PDF
Algorithms for mutual exclusion
TLDR
The problem of mutual exclusion - or of defining fundamental operations so that it is possible to resolve conflicts resulting from several concurrent processes sharing the resources of a computer system - has emerged over the last 20 years as a prime example of the difficulties associated with parallel or distributed programming. Expand
  • 385
  • 11
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
  • 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
  • 54
  • 11
  • PDF
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
  • 134
  • 10
  • PDF
Logical Time: Capturing Causality in Distributed Systems
TLDR
This paper presents a general framework of a system of logical clocks in distributed systems and discusses three methods for implementing logical time in these systems. Expand
  • 244
  • 9