Abstract
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.
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
Arif, S.F., Merchant, A., Saito, Y., Spence, S., Veitch, A.: Fab: enterprise storage systems on a shoestring. In: Operating Systems, Lihue, HI, May 18-21, pp. 133–138. USENIX Association (2003)
Benders, J.F.: Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4, 238–252 (1962)
Georgiou, C., Musial, P.M., Shvartsman, A.A.: Long-lived rambo: Trading knowledge for communication. Theor. Comput. Sci. 383(1), 59–85 (2007)
Gilbert, S., Lynch, N.A., Shvartsman, A.A.: RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In: DSN, pp. 259–268. IEEE Computer Society, Los Alamitos (2003)
Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Operations Research 37(6), 865–893 (1989)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
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)
Smith, B.M.: Sets of symmetry breaking constraints. In: Proc. of SymCon, vol. 5 (2005)
Thomas, R.H.: A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4(2), 180–209 (1979)
Van Hentenryck, P., Michel, L.: Control Abstraction for Local Search. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 65–80. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michel, L., Moraal, M., Shvartsman, A., Sonderegger, E., Van Hentenryck, P. (2009). Online Selection of Quorum Systems for RAMBO Reconfiguration. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04244-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04243-0
Online ISBN: 978-3-642-04244-7
eBook Packages: Computer ScienceComputer Science (R0)