TY - GEN
T1 - Load balancing and almost symmetries for RAMBO quorum hosting
AU - Michel, Laurent
AU - Shvartsman, Alexander A.
AU - Sonderegger, Elaine
AU - Van Hentenryck, Pascal
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 - 2010
Y1 - 2010
N2 - Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where the participating hosts may join, leave, or fail. To maintain availability and consistency in such dynamic settings, Rambo replicates objects and uses quorum systems that can be reconfigured in response to perturbations in the environment. This is accomplished by installing new quorum configurations and removing obsolete configurations, while preserving data consistency. Given the dynamic nature of the atomic memory service, it is vitally important to reconfigure the system online, while making well-reasoned selections of new quorum configurations. This paper reexamines the quorum hosting problem, concentrating on better load balancing models and a novel use of almost symmetries for breaking similarities among hosts in the target network. The resultant performance improvements allow more reasonably-sized systems to be reconfigured online in a way that optimizes hosting of quorums with respect to relevant performance criteria.
AB - Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where the participating hosts may join, leave, or fail. To maintain availability and consistency in such dynamic settings, Rambo replicates objects and uses quorum systems that can be reconfigured in response to perturbations in the environment. This is accomplished by installing new quorum configurations and removing obsolete configurations, while preserving data consistency. Given the dynamic nature of the atomic memory service, it is vitally important to reconfigure the system online, while making well-reasoned selections of new quorum configurations. This paper reexamines the quorum hosting problem, concentrating on better load balancing models and a novel use of almost symmetries for breaking similarities among hosts in the target network. The resultant performance improvements allow more reasonably-sized systems to be reconfigured online in a way that optimizes hosting of quorums with respect to relevant performance criteria.
UR - http://www.scopus.com/inward/record.url?scp=78149253276&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149253276&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15396-9_47
DO - 10.1007/978-3-642-15396-9_47
M3 - Conference contribution
AN - SCOPUS:78149253276
SN - 364215395X
SN - 9783642153952
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 598
EP - 612
BT - Principles and Practice of Constraint Programming, CP 2010 - 16th International Conference, Proceedings
PB - Springer Verlag
T2 - 16th International Conference on Principles and Practice of Constraint Programming, CP 2010
Y2 - 6 September 2010 through 10 September 2010
ER -