• Publications
  • Influence
Lightweight probabilistic broadcast
TLDR
This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional Probabilistic Broadcast algorithms with a scalable memory management technique. Expand
  • 596
  • 50
  • PDF
PeerReview: practical accountability for distributed systems
TLDR
We describe PeerReview, a system that provides accountability in distributed systems that provides Byzantine faults whose effects are observed by a correct node are eventually detected and irrefutably linked to a faulty node. Expand
  • 366
  • 49
  • PDF
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
TLDR
We prove that it is impossible to build concurrent implementations of classic and ubiquitous specifications such as sets, queues, stacks, mutual exclusion and read-modify-write operations, that completely eliminate the use of expensive synchronization. Expand
  • 117
  • 10
  • PDF
Microbially-accelerated consolidation of oil sands tailings. Pathway I: changes in porewater chemistry
Dispersed clay particles in mine tailings and soft sediments remain suspended for decades, hindering consolidation and challenging effective management of these aqueous slurries. Current geotechnicalExpand
  • 48
  • 10
  • PDF
The Case for Byzantine Fault Detection
TLDR
We explore an alternative approach that aims at detecting rather than masking faulty behavior. Expand
  • 71
  • 8
  • PDF
The weakest failure detectors to solve certain fundamental problems in distributed computing
TLDR
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments -- i.e., regardless of number and timing of crashes. Expand
  • 129
  • 7
  • PDF
Lightweight probabilistic broadcast
TLDR
The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Expand
  • 61
  • 7
Computing with Reads and Writes in the Absence of Step Contention
TLDR
We present a generic obstruction-free object implementation that has linear contention-free step complexity (number of reads and writes taken by a process running solo) and uses a linear number of read/write objects. Expand
  • 49
  • 7
  • PDF
Zeno: Eventually Consistent Byzantine-Fault Tolerance
TLDR
This paper presents a novel BFT state machine replication protocol called Zeno that trades consistency for higher availability. Expand
  • 101
  • 6
  • PDF
Mutual exclusion in asynchronous systems with failure detectors
TLDR
This paper considers the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem, given a majority of correct processes. Expand
  • 62
  • 6
  • PDF