12 citations · 43 across the 13 of their papers we have counts for
17 papers
Optimality and Trade-offs in Fast BFT SMR (Extended Version)
Neil Giridharan, Minh Tung Nguyen, Ittai Abraham +3
Fast state-machine replication (SMR) protocols in the crash-fault setting have attracted significant interest in both academia and industry. This interest stems from their advantag…
Revisiting Lower Bounds for Two-Step Consensus
Fedor Ryabinin, Alexey Gotsman, Pierre Sutra
A seminal result by Lamport shows that at least processes are required to implement partially synchronous consensus that tolerates process failures and ca…
Adjusted Objects: An Efficient and Principled Approach to Scalable Programming (Extended Version)
Boubacar Kane, Pierre Sutra
Parallel programs require software support to coordinate access to shared data. For this purpose, modern programming languages provide strongly-consistent shared objects. To accoun…
Generic Multicast (Extended Version)
José Augusto Bolina, Pierre Sutra, Douglas Antunes Rocha +1
Communication primitives play a central role in modern computing. They offer a panel of reliability and ordering guarantees for messages, enabling the implementation of complex dis…
The Weakest Failure Detector for Genuine Atomic Multicast (Extended Version)
Pierre Sutra
Atomic broadcast is a group communication primitive to order messages across a set of distributed processes. Atomic multicast is its natural generalization where each message i…
Efficient Replication via Timestamp Stability (Extended Version)
Vitor Enes, Carlos Baquero, Alexey Gotsman +1
Modern web applications replicate their data across the globe and require strong consistency guarantees for their most critical data. These guarantees are usually provided via stat…