Abstract
A particular case of open group is that of a large–scale system where an unbounded and dynamically changing set of client nodes continuously connect and disconnect from a reduced and stable group of servers. We propose an extended specification of the membership problem, that takes into account the different consistency properties that both types of nodes require from the membership information in such a scenario. The specification is completely independent of any group communication layer, assuming only the presence of a local failure detector at each node. We also describe a membership service that satisfies the specification and sketch a proof for its properties.
Partially supported by the EU grant IST-1999-20997, by Spanish Research Council (CICYT), under grant TIC2003-09420-C02-01 and by the Polytechnic University of Valencia, under grant 20030549.
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
Cristian, F.: Reaching agreement on processor-group membership in synchronous distributed systems. Distributed Computing 4(4), 175–188 (1991)
Chandra, T.D., et al.: On the impossibility of group membership. In: Proceed- ings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC 1996), pp. 322–330. ACM, New York (1996)
Anceaume, E., et al.: On the formal speci¯cation of group membership services. Technical Report TR95-1534, 25 (1995)
Malloth, C.P., Schiper, A.: View synchronous communication in large scale distributed systems. In: Proceedings of the 2nd Open Workshop of the ESPRIT project BROADCAST (6360), Grenoble, France (1995)
Ricciardi, A., Birman, K.P.: Process membership in asynchronous environ- ments. Technical Report NTR 92-1328, Department of Computer Science, Cornell University, Ithaca, New York (February 1993)
Amir, Y., et al.: The Totem single-ring ordering and membership protocol. ACM Transactions on Computer Systems 13(4), 311–342 (1995)
Chockler, G., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Computing Surveys 33(4), 427–469 (2001)
Babaoglu, O., Davoli, R., Montresor, A.: Group communication in partitionable systems: Specification and algorithms. Software Engineering 27(4), 308–336 (2001)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Bañuls, M.C., Galdámez, P.: Technical Report ITI-ITE-03/01, Instituto Tecnológico de Informática, Univ. Politécnica Valencia (2003), http://www.iti.upv.es/sifi/en/publications/2003/index.html
Muñoz, F.D., Galdámez, P., Bernabéu, J.M.: HMM: A membership protocol for a multi-computer cluster. Technical Report ITI-DE-2000/02, Instituto Tecnológico de Informática, Univ. Politécnica Valencia (February 2000)
Keidar, I., et al.: A client-server oriented algorithm for virtually synchronous group membership in WANs. In: International Conference on Distributed Computing Systems, pp. 356–365 (2000)
Babaoglu, O., Schiper, A.: On group communication in large-scale distributed systems. In: ACM SIGOPS European Workshop, pp. 17–22 (1994)
Karamanolis, C.T., Magee, J.N.: Client access protocols for replicated services. Software Engineering 25(1), 3–21 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bañuls, MC., Galdámez, P. (2005). Extended Membership Problem for Open Groups: Specification and Solution. In: Daydé, M., Dongarra, J., Hernández, V., Palma, J.M.L.M. (eds) High Performance Computing for Computational Science - VECPAR 2004. VECPAR 2004. Lecture Notes in Computer Science, vol 3402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11403937_23
Download citation
DOI: https://doi.org/10.1007/11403937_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25424-9
Online ISBN: 978-3-540-31854-5
eBook Packages: Computer ScienceComputer Science (R0)