Dynamic atomic storage without consensus
From MaRDI portal
Recommendations
Cited in
(14)- Consistency in nondeterministic storage
- Simulating a shared register in an asynchronous system that never stops changing (extended abstract)
- On liveness of dynamic storage
- Asynchronous reconfiguration with Byzantine failures
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Implementing set objects in dynamic distributed systems
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- Dynamic regular registers in systems with churn
- scientific article; zbMATH DE number 2013830 (Why is no real title available?)
- Computing k-atomicity in polynomial time
- Dynamic atomic storage without consensus
- A coded shared atomic memory algorithm for message passing architectures
- Asynchronous reconfiguration with Byzantine failures
- Dynamic Byzantine reliable broadcast
This page was built for publication: Dynamic atomic storage without consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3016254)