Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
PeerReview: practical accountability for distributed systems
TLDR
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.
View on ACM
Lightweight probabilistic broadcast
TLDR
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.
View on ACM
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
TLDR
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.
View on ACM
Zeno: Eventually Consistent Byzantine-Fault Tolerance
TLDR
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.
View Paper
The weakest failure detectors to solve certain fundamental problems in distributed computing
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.…
View on ACM
The Case for Byzantine Fault Detection
TLDR
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.
View Paper
The consensus number of a cryptocurrency
TLDR
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.
View on ACM
Computing with Reads and Writes in the Absence of Step Contention
TLDR
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.
View via Publisher
Mutual exclusion in asynchronous systems with failure detectors
View via Publisher
The weakest failure detectors to boost obstruction-freedom
TLDR
It is shown that wait-free contention managers, unlike their non-blocking counterparts, impose an inherent non-trivial overhead even in contention-free executions.
View on Springer
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License