5 citations · 5 across the 5 of their papers we have counts for
10 papers · 1 filter
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,…
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…