Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems

DOI10.1007/978-3-319-09620-9_5MaRDI QIDQ5496147zbMATH OpenOpenAlexFDO

Authors Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer

Publication date 7 August 2014

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09620-9_5

zbMATH Keywords

\(t\)-resilienceapproximate agreementasynchronous message-passing systematomic read/write registerbroadcast abstractionByzantine processdistributed computingquorumreliable broadcastreliable shared memorysingle-writer/multi-reader register

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Byzantine disk paxos
• Sharing memory robustly in message-passing systems
• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)

Cited in

(13)

• An asynchronous protocol for release consistent distributed shared memory systems
• Tight bounds for shared memory systems accessed by Byzantine processes
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
• scientific article; zbMATH DE number 1696685 (Why is no real title available?)
• Robust simulation of shared memory: 20 years after
• scientific article; zbMATH DE number 177544 (Why is no real title available?)
• Sharing memory robustly in message-passing systems
• scientific article; zbMATH DE number 2013833 (Why is no real title available?)
• Money transfer made simple: a specification, a generic algorithm, and its proof
• Objects shared by Byzantine processes
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• Byzantine-tolerant privacy-preserving atomic register

This page was built for publication: Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems

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