Share This Author
PeerReview: practical accountability for distributed systems
It is demonstrated that PeerReview is practical by applying it to three different types of distributed systems: a network filesystem, a peer-to-peer system, and an overlay multicast system.
Lightweight probabilistic broadcast
- P. Eugster, R. Guerraoui, S. Handurukande, P. Kuznetsov, Anne-Marie Kermarrec
- Computer ScienceInternational Conference on Dependable Systems…
- 1 July 2001
Lightweight Probabilistic Broadcast is presented, a novel gossip-based broadcast algorithm which preserves the inherent throughput scalability of traditional gossip- based algorithms and adds a notion of membership management scalability: every process only knows a random subset of fixed size of the processes in the system.
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
- H. Attiya, R. Guerraoui, Danny Hendler, P. Kuznetsov, Maged M. Michael, Martin T. Vechev
- Computer SciencePOPL '11
- 26 January 2011
It is proved 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.
Zeno: Eventually Consistent Byzantine-Fault Tolerance
- Atul Singh, Pedro Fonseca, P. Kuznetsov, R. Rodrigues, Petros Maniatis
- Computer ScienceNSDI
- 22 April 2009
A novel BFT state machine replication protocol called Zeno that trades consistency for higher availability and replaces strong consistency with a weaker guarantee (eventual consistency): clients can temporarily miss each other's updates but when the network is stable the states from the individual partitions are merged by having the replicas agree on a total order for all requests.
The weakest failure detectors to solve certain fundamental problems in distributed computing
- C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kuznetsov, S. Toueg
- Computer SciencePODC '04
- 25 July 2004
We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments -- i.e., regardless of the number and timing of crashes.…
The Case for Byzantine Fault Detection
This paper considers general (Byzantine) failures, in which a failed node may exhibit arbitrary behavior, and examines the trade-offs between fault detection and traditional BFT.
The consensus number of a cryptocurrency
- R. Guerraoui, P. Kuznetsov, M. Monti, M. Pavlovic, Dragos-Adrian Seredinschi
- Computer SciencePODC
- 13 June 2019
An asynchronous Byzantine fault-tolerant asset transfer implementation that is both simpler and more efficient than state-of-the-art consensus-based solutions is described.
Computing with Reads and Writes in the Absence of Step Contention
This paper presents a generic obstruction-free object implementation that has a linear contention-free step complexity and uses a linear number of read/write objects, and shows that any object has a solo-fast implementation of consensus, i.e., they are also inherently slow.
Mutual exclusion in asynchronous systems with failure detectors
The weakest failure detectors to boost obstruction-freedom
It is shown that wait-free contention managers, unlike their non-blocking counterparts, impose an inherent non-trivial overhead even in contention-free executions.