TY - GEN
T1 - RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks.
T2 - 16th International Conference on Distributed Computing, DISC 2002
AU - Lynch, Nancy
AU - Shvartsman, Alex A.
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2002
Y1 - 2002
N2 - 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 newconfigurations, 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.
AB - 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 newconfigurations, 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.
UR - http://www.scopus.com/inward/record.url?scp=84947256658&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947256658&partnerID=8YFLogxK
U2 - 10.1007/3-540-36108-1_12
DO - 10.1007/3-540-36108-1_12
M3 - Conference contribution
AN - SCOPUS:84947256658
SN - 3540000739
SN - 9783540000730
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 173
EP - 190
BT - Distributed Computing - 16th International Conference, DISC 2002, Proceedings
A2 - Malkhi, Dahlia
PB - Springer Verlag
Y2 - 28 October 2002 through 30 October 2002
ER -