Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
A dynamic accessibility protocol for replicated databases
Data & Knowledge Engineering
Atomic snapshots of shared memory
Journal of the ACM (JACM)
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)
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
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
The weakest failure detectors to solve certain fundamental problems in distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
Boxwood: abstractions as the foundation for storage infrastructure
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
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
ACM SIGACT News
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
EWDC '11 Proceedings of the 13th European Workshop on Dependable Computing
Validity bound of regular registers with churn and byzantine processes
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multi-writer regular registers in dynamic distributed systems with byzantine failures
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
An algorithm for implementing BFT registers in distributed systems with bounded churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Surviving congestion in geo-distributed storage systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Brief announcement: atomic consistency and partition tolerance in scalable key-value stores
DISC'12 Proceedings of the 26th international conference on Distributed Computing
CATS: a linearizable and self-organizing key-value store
Proceedings of the 4th annual Symposium on Cloud Computing
A protocol for implementing byzantine storage in churn-prone distributed systems
Theoretical Computer Science
| Hi-index | 0.00 |
This paper 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 paper, we specify the problem of dynamic atomic R/W 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.