On implementing SWMR registers from SWSR registers in systems with Byzantine failures

DOI10.1007/S00446-024-00465-5MaRDI QIDQ6579854FDOQ6579854

Authors: Xing Hu, Sam Toueg 

Publication date: 26 July 2024

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

distributed computingconcurrencylinearizabilityshared registers

Mathematics Subject Classification ID

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

Cites Work

• Constructing 1-writer multireader multivalued atomic variables from regular variables
• Optimal multi-writer multi-reader atomic register
• Sharing memory robustly in message-passing systems
• Concurrent Reading While Writing
• Linearizable implementations do not suffice for randomized distributed computation
• Constructing two-writer atomic registers
• Converting Lamport's regular register to atomic register
• A very simple construction of 1-writer multireader multivalued atomic variable
• The Impact of RDMA on Agreement
• Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
• Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer

This page was built for publication: On implementing SWMR registers from SWSR registers in systems with Byzantine failures

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