How to assign votes in a distributed system
Journal of the ACM (JACM)
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
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)
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)
Brief announcement: efficient replication of large data objects
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
SQUARE: scalable quorum-based atomic memory with local reconfiguration
Proceedings of the 2007 ACM symposium on Applied computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Long-lived Rambo: Trading knowledge for communication
Theoretical Computer Science
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
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Developing a Consistent Domain-Oriented Distributed Object Service
IEEE Transactions on Parallel and Distributed Systems
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Hi-index | 0.00 |
This paper considers quorum-replicated, multi-writer, multi-reader (MWMR) implementations of survivable atomic registers in a distributed message-passing system with processors prone to failures. Previous implementations in such settings invariably required two rounds of communication between readers/writers and replica owners. Hence the question arises whether it is possible to have single round read and/or write operations in this setting. We thus devise an algorithm, called Sfw , that exploits a new technique called server side ordering (SSO ), which ---unlike previous approaches--- places partial responsibility for the ordering of write operations on the replica owners (the servers). With SSO, fast write operations are introduced for the very first time in the MWMR setting. We prove that our algorithm preserves atomicity in all permissible executions. While algorithm SFW shows that in principle fast writes are possible, we also show that under certain conditions the MWMR model imposes inherent limitations on any quorum-based fast write implementation of a safe read/write register and potentially even restricts the number of writer participants in the system. In this case our algorithm achieves near optimal efficiency.