TY - GEN
T1 - Online selection of quorum systems for rambo reconfiguration
AU - Michel, Laurent
AU - Moraal, Martijn
AU - Shvartsman, Alexander
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 - 2009
Y1 - 2009
N2 - Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic, rapidly changing networking environments. Rambo is particularly apt at dealing with volatile environments such as mobile networks. To maintain availability and consistency, even as hosts join, leave, and fail, Rambo replicates objects and uses reconfigurable quorum systems. As the system dynamically changes, Rambo installs new quorum configurations. This paper addresses the reconfiguration problem with three approaches based on a finite-domain model, an hybrid master-slave decomposition and a parallel composite to find optimal or near-optimal configurations. Current behaviors of Rambo participants are observed, gossiped, and used as predictors for future behaviors, with the goal of finding quorum configurations that minimize read and write operation delays without affecting correctness and fault-tolerance properties of the system.
AB - Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic, rapidly changing networking environments. Rambo is particularly apt at dealing with volatile environments such as mobile networks. To maintain availability and consistency, even as hosts join, leave, and fail, Rambo replicates objects and uses reconfigurable quorum systems. As the system dynamically changes, Rambo installs new quorum configurations. This paper addresses the reconfiguration problem with three approaches based on a finite-domain model, an hybrid master-slave decomposition and a parallel composite to find optimal or near-optimal configurations. Current behaviors of Rambo participants are observed, gossiped, and used as predictors for future behaviors, with the goal of finding quorum configurations that minimize read and write operation delays without affecting correctness and fault-tolerance properties of the system.
UR - http://www.scopus.com/inward/record.url?scp=70350402381&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350402381&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04244-7_10
DO - 10.1007/978-3-642-04244-7_10
M3 - Conference contribution
AN - SCOPUS:70350402381
SN - 3642042430
SN - 9783642042430
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 88
EP - 103
BT - Principles and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings
T2 - 15th International Conference on Principles and Practice of Constraint Programming, CP 2009
Y2 - 20 September 2009 through 24 September 2009
ER -