How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
How to share memory in a distributed system
Journal of the ACM (JACM)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Efficient message ordering in dynamic networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
Distributed Algorithms
A Dynamic Primary Configuration Group Communication Service
Proceedings of the 13th International Symposium on Distributed Computing
Consensus service: a modular approach for building agreement protocols in distributed systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
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)
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Synthesis of fault-tolerant concurrent programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
FAB: building distributed enterprise disk arrays from commodity components
ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Consistent and automatic replica regeneration
ACM Transactions on Storage (TOS)
Fastpath Optimizations for Cluster Recovery in Shared-Disk Systems
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Brief announcement: abstractions for implementing atomic objects in dynamic systems
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
Scalable and dynamic quorum systems
Distributed Computing
Fault-tolerant semifast implementations of atomic read/write registers
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
The SMART way to migrate replicated stateful services
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
SQUARE: scalable quorum-based atomic memory with local reconfiguration
Proceedings of the 2007 ACM symposium on Applied computing
FAB: enterprise storage systems on a shoestring
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Consistent and automatic replica regeneration
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
ACMS: the Akamai configuration management system
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Long-lived Rambo: Trading knowledge for communication
Theoretical Computer Science
The collective memory of amnesic processes
ACM Transactions on Algorithms (TALG)
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Shared focus of attention for heterogeneous agents
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Fault-tolerant semifast implementations of atomic read/write registers
Journal of Parallel and Distributed Computing
Reconfigurable distributed storage for dynamic networks
Journal of Parallel and Distributed Computing
CMV: File consistency maintenance through virtual servers in peer-to-peer systems
Journal of Parallel and Distributed Computing
FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
A case for P2P infrastructure for social networks - opportunities & challenges
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
ACM SIGACT News
Timed quorum systems for large-scale and dynamic environments
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal deployment of eventually-serializable data services
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing
Online selection of quorum systems for RAMBO reconfiguration
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Communication and data sharing for dynamic distributed systems
Future directions in distributed computing
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Load balancing and almost symmetries for RAMBO quorum hosting
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Dynamic atomic storage without consensus
Journal of the ACM (JACM)
EWDC '11 Proceedings of the 13th European Workshop on Dependable Computing
The complexity of robust atomic storage
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
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
ACM SIGACT News
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
Programming an amorphous computational medium
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Core persistence in peer-to-peer systems: relating size to lifetime
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Proving atomicity: an assertional approach
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and 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 presents an algorithm that emulates atomic read/write shared objects in a dynamic network setting. To ensure availability and faulttolerance, the objects are replicated. To ensure atomicity, reads and writes are performed using quorum configurations, each of which consists of a set of members plus sets of read-quorums and write-quorums. The algorithm is reconfigurable: the quorum configurations may change during computation, and such changes do not cause violations of atomicity. Any quorum configuration may be installed at any time. The algorithm tolerates processor stopping failure and message loss. The algorithm performs three major tasks, all concurrently: reading and writing objects, introducing new configurations, and "garbage-collecting" obsolete configurations. The algorithm guarantees atomicity for arbitrary patterns of asynchrony and failure. The algorithm satisfies a variety of conditional performance properties, based on timing and failure assumptions. In the "normal case", the latency of read and write operations is at most 8d, where d is the maximum message delay.