25 citations · 50 across the 9 of their papers we have counts for
12 papers
Finding Nemo-Nemo: CFT DAG-based Consensus in the WAN
Rithwik Kerur, Pasindu Tennage, Philipp Jovanovic +3
This paper introduces Nemo-Nemo, a practical crash-fault tolerant (CFT) consensus protocol designed to outperform existing protocols in wide-area networks by bridging design princi…
SWARM: Replicating Shared Disaggregated-Memory Data in No Time
Antoine Murat, Clément Burgelin, Athanasios Xygkis +3
Memory disaggregation is an emerging data center architecture that improves resource utilization and scalability. Replication is key to ensure the fault tolerance of applications,…
DSig: Breaking the Barrier of Signatures in Data Centers
Marcos K. Aguilera, Clément Burgelin, Rachid Guerraoui +3
Data centers increasingly host mutually distrustful users on shared infrastructure. A powerful tool to safeguard such users are digital signatures. Digital signatures have revoluti…
Efficient Signature-Free Validated Agreement
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert +4
Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit comple…
Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert +4
Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzan…
Parallel -Core Decomposition with Batched Updates and Asynchronous Reads
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Maintaining a dynamic -core decomposition is an important problem that identifies dense subgraphs in dynamically changing graphs. Recent work by Liu et al. [SPAA 2022] presents…
Honeycomb: ordered key-value store acceleration on an FPGA-based SmartNIC
Junyi Liu, Aleksandar Dragojevic, Shane Flemming +6
In-memory ordered key-value stores are an important building block in modern distributed applications. We present Honeycomb, a hybrid software-hardware system for accelerating read…
uBFT: Microsecond-scale BFT using Disaggregated Memory [Extended Version]
Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui +3
We propose uBFT, the first State-Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only replicas to tolerate Byzantine…
Frugal Byzantine Computing
M. K. Aguilera, N. Ben-David, R. Guerraoui +3
Traditional techniques for handling Byzantine failures are expensive: digital signatures are too costly, while using replicas is uneconomical ( denotes the maximum numb…
Microsecond Consensus for Microsecond Applications
Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui +3
We consider the problem of making apps fault-tolerant through replication, when apps operate at the microsecond scale, as in finance, embedded computing, and microservices apps. Th…
Efficient Multi-word Compare and Swap
Rachid Guerraoui, Alex Kogan, Virendra J. Marathe +1
Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementat…
The Impact of RDMA on Agreement
Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui +2
Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mec…