RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
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
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
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
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Communication and data sharing for dynamic distributed systems
Future directions in distributed computing
Dynamic atomic storage without consensus
Journal of the ACM (JACM)
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Providing shared-memory abstraction in message-passing systems often simplifies the development of distributed algorithms and allows for the reuse of shared-memory algorithms in the message-passing setting. Attiya, Bar-Noy, and Dolev (1995) developed a robust emulation of atomic single-writer/multi-reader registers in message-passing systems, this emulation was extended by Lynch and Shvartsman (1997) to multi-writer/multi-reader registers using reconfigurable quorum systems.In this work we present a new atomic multi-writer/multi-reader register service that includes a fault-tolerant reconfiguration service. This new emulation has a substantially improved performance and fault-tolerance characteristics. We introduce the concept of intermediate quorum configurations and show how they can be used by readers/writers during reconfiguration.The result is that the quorum reconfigurations are graceful: readers and writers no longer 驴busy-wait驴 during reconfigurations but are able to complete their operations. An additional advance is that the reconfigurer is eliminated as the single point of failure.When the reconfigurer fails, readers and writers continue using intermediate configurations. In finite executions, read and write operations terminate in bounded time using bounded number of messages (the bounds depend on the 驴currency驴 of the configuration at the invoker of the operation).Finally, the service places no restrictions on the installed quorum configuration: A previously installed quorum system can be replaced by an arbitrary new quorum system. Our algorithms are specified using I/O Automata; the safety proofs use the partial order techniques and invariants, and the performance is assessed using operational reasoning.