Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Distributed Algorithms
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
A Framework for Dynamic Byzantine Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Brief announcement: reconfigurable byzantine-fault-tolerant atomic memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Chain replication for supporting high throughput and availability
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Vertical paxos and primary-backup replication
Proceedings of the 28th ACM symposium on Principles of distributed computing
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Online migration for geo-distributed storage systems
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Fork-Consistent constructions from registers
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Dynamic reconfiguration of primary/backup clusters
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Brief announcement: decoupled and consensus-free reconfiguration for fault-tolerant storage
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Dynamic regular registers in systems with churn
Theoretical Computer Science
Dagstuhl seminar review: consistency in distributed systems
ACM SIGACT News
| Hi-index | 0.01 |
This article deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storage can be implemented in a fault-tolerant manner even if the system is completely asynchronous, whereas consensus is not solvable. In contrast, all existing emulations of atomic storage in dynamic systems rely on consensus or stronger primitives, leading to a popular belief that dynamic R/W storage is unattainable without consensus. In this article, we specify the problem of dynamic atomic read/write storage in terms of the interface available to the users of such storage. We discover that, perhaps surprisingly, dynamic R/W storage is solvable in a completely asynchronous system: we present DynaStore, an algorithm that solves this problem. Our result implies that atomic R/W storage is in fact easier than consensus, even in dynamic systems.