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

DOI10.1007/S00446-024-00465-5MaRDI QIDQ6579854zbMATH OpenFDO

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

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

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)