Abstract
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are close together, intersect with high probability. We present an algorithm that implements TQS at its core and that provides operations that respect atomicity with high probability. This TQS implementation has quorums of size \(O(\sqrt{nD})\) and expected access time of \(O(\log{\sqrt{nD}})\) message delays, where n measures the size of the system and D is a required parameter to handle dynamism. This algorithm is shown to have complexity sub-linear in size and dynamism of the system, and hence to be scalable. It is also shown that for systems where operations are frequent enough, the system achieves the lower bound on quorum size for probabilistic quorums in static systems, and it is thus optimal in that sense.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Herlihy, M.: Dynamic quorum adjustment for partitioned data. ACM Trans. Database Syst. 12(2), 170–194 (1987)
Lynch, N., Shvartsman, A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 173–190. Springer, Heidelberg (2002)
Friedman, R., Raynal, M., Travers, C.: Two abstractions for implementing atomic objects in dynamic systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 73–87. Springer, Heidelberg (2006)
Chockler, G., Gilbert, S., Gramoli, V., Musial, P., Shvartsman, A.: Reconfigurable distributed storage for dynamic networks. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 214–219. Springer, Heidelberg (2006)
Naor, M., Wool, A.: The load, capacity, and availability of quorum systems. SIAM Journal on Computing 27(2), 423–447 (1998)
Nadav, U., Naor, M.: The dynamic and-or quorum system. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 472–486. Springer, Heidelberg (2005)
Abraham, I., Malkhi, D.: Probabilistic quorum systems for dynamic systems. Distributed Computing 18(2), 113–124 (2005)
Gramoli, V., Anceaume, E., Virgillito, A.: SQUARE: Scalable quorum-based atomic memory with local reconfiguration. In: SAC 2007. Proceedings of the 22nd ACM Symposium on Applied Computing, pp. 574–579. ACM Press, New York (2007)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Malkhi, D., Reiter, M., Wool, A., Wright, R.: Probabilistic quorum systems. The Information and Computation Journal 170(2), 184–206 (2001)
Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM 2001, San Diego, CA (2001)
Ganesh, A.J., Kermarrec, A.M., Massoulié, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52(2), 139–149 (2003)
Ganesh, A.J., Kermarrec, A.M., Le Merrer, E., Massoulié, L.: Peer counting and sampling in overlay networks based on random walks. In: Distributed Computing (2007)
Attiya, H., Welch, J.: Distributed Computing. In: Fundamentals, Simulations, and Advanced Topics., McGraw-Hill, New York (1998)
Voulgaris, S., Gavidia, D., van Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management 13(2), 197–217 (2005)
Iwanicki, K.: Gossip-based dissemination of time. Master’s thesis, Warsaw University - Vrije Universiteit Amsterdam (2005)
Fernández, A., Gramoli, V., Jiménez, E., Kermarrec, A.M., Raynal, M.: Distributed slicing in dynamic systems. In: ICDCS 2007. Proceedings of the 27th International Conference on Distributed Computing Systems, IEEE Computer Society Press, Los Alamitos (2007)
Gramoli, V., Raynal, M.: Timed quorum system for large-scale dynamic environments. Technical Report 1859, INRIA Research Centre Rennes (2007)
Gramoli, V., Kermarrec, A.M., Mostefaoui, A., Raynal, M., Sericola, B.: Core persistence in peer-to-peer systems: Relating size to lifetime. In: Meersman, R., Tari, Z., Herrero, P. (eds.) On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops. LNCS, vol. 4278, pp. 1470–1479. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gramoli, V., Raynal, M. (2007). Timed Quorum Systems for Large-Scale and Dynamic Environments. In: Tovar, E., Tsigas, P., Fouchal, H. (eds) Principles of Distributed Systems. OPODIS 2007. Lecture Notes in Computer Science, vol 4878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77096-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-77096-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77095-4
Online ISBN: 978-3-540-77096-1
eBook Packages: Computer ScienceComputer Science (R0)