Abstract
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.
This work was partially supported through NSF awards CCF-0702670 and IIS-0642906 and AFOSR Contract FA955007C0114.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Donaldson, A.F., Gregory, P.: Almost-Symmetry in Search (SymNet Workshop Proceedings). Technical Report TR-2005-201, University of Glasgow (2005)
Fox, M., Long, D., Porteous, J.: Discovering near symmetry in graphs. In: Proceedings of AAAI (2007)
Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the Seventh Symposium on Operating System Principles (SOSP), pp. 150–162 (1979)
Gilbert, S., Lynch, N.A., Shvartsman, A.A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: IEEE/IFIP International Conference on Dependable Systems and Networks, pp. 259–268 (2003)
Long, D., Fox, M.: Symmetries in planning problems. In: SymCon 2003, CP Workshop (2003)
Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the 16th International Symposium on Distributed Computing, pp. 173–190 (2002)
Michel, L., Moraal, M., Shvartsman, A., Sonderegger, E., Van Hentenryck, P.: Online Selection of Quorum Systems for RAMBO Reconfiguration. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 88–103. Springer, Heidelberg (2009)
Michel, L., See, A., Van Hentenryck, P.: Parallelizing constraint programs transparently. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 514–528. Springer, Heidelberg (2007)
Porteous, J., Long, D., Fox, M.: The identification and exploitation of almost symmetry in planning problems. In: Brown, K. (ed.): Proceedings of the 23rd UK Planning and Scheduling SIG (2004)
Prestwich, S., Beck, J.C.: Exploiting dominance in three symmetric problems. In: Fourth International Workshop on Symmetry and Constraint Satisfaction Problems, pp. 63–70 (2004)
Schaus, P., Van Hentenryck, P., Régin, J.-C.: Scalable Load Balancing in Nurse to Patient Assignment Problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 193–207. Springer, Heidelberg (2009)
Smith, B.M.: Sets of symmetry breaking constraints. In: SymCon, vol. 5 (2005)
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems 4(2), 180–209 (1979)
Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2005)
Van Hentenryck, P., Michel, L.: Nondeterministic control for hybrid search. Constraints 11(4), 353–373 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michel, L., Shvartsman, A.A., Sonderegger, E., Van Hentenryck, P. (2010). Load Balancing and Almost Symmetries for RAMBO Quorum Hosting . In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)