The Impact of RDMA on Agreement

DOI10.1145/3293611.3331601MaRDI QIDQ5145244zbMATH OpenOpenAlexFDO

Authors Naama Ben-David, Virendra J. Marathe, Igor Zablotchi, Marcos Kawazoe Aguilera, Rachid Guerraoui

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.12143, http://infoscience.epfl.ch/record/275877

zbMATH Keywords

consensusfault toleranceByzantine agreementRDMA

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• On atomic registers and randomized consensus in m\&m systems
• Fast and simple distributed consensus
• Fast Distributed Agreement
• A fast RDMA offload method for unreliable interconnection networks
• scientific article; zbMATH DE number 2080904

Cited in

(4)

• A calculus for attribute-based memory updates
• On atomic registers and randomized consensus in m\&m systems
• On implementing SWMR registers from SWSR registers in systems with Byzantine failures
• AbU: a calculus for distributed event-driven programming with attribute-based interaction

This page was built for publication: The Impact of RDMA on Agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145244)