Robust simulation of shared memory: 20 years after
From MaRDI portal
Recommendations
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- The collective memory of amnesic processes
- Sharing memory robustly in message-passing systems
- Reliable shared memory abstraction on top of asynchronous Byzantine message-passing systems
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
Cited in
(8)- Practically stabilizing SWMR atomic memory in message-passing systems
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- An Optical Simulation of Shared Memory
- Exploiting storage redundancy to speed up randomized shared memory simulations
- Efficient and Robust Sharing of Memory in Message-Passing Systems
- The collective memory of amnesic processes
- Shared-memory mutual exclusion: major research trends since 1986
- Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
This page was built for publication: Robust simulation of shared memory: 20 years after
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568108)
