Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
From MaRDI portal
Publication:5496147
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
- Objects shared by Byzantine processes (Extended abstract)
- Robust simulation of shared memory: 20 years after
- Sharing memory in asynchronous message passing systems
- Sharing memory robustly in message-passing systems
- Tight bounds for shared memory systems accessed by Byzantine processes
- 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)