Abstract
Chandra et al. [5] showed that the group membership problem cannot be solved in asynchronous systems with crash failures. We identify the main assumptions required for their proof and show how to circumvent this impossibility result building a weaker, yet non trivial specification. We provide an algorithm that solves this specification and show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification.
This work was supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship, by an IBM Partnership Award and by DARPA through an agreement with NASA/OSAT.
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
M. Ben-Or. “Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols”. Proceedings of the Second ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 27–30, August 1983.
G. Brancha and S. Toueg. “Resilent Consensus Protocols”. Proceedings of the Second ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 12–26, August 1983.
T. D. Chandra and S. Toueg. “Unreliable Failure Detectors for Reliable Distributed Systems”. Journal of the ACM 43-2 pp. 225–267, March 1996.
T. D. Chandra, V. Hadzillacos, S. Toueg. “The Weakest Failure Detector for Solving Consensus”. Proceedings of the Eleventh ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 147–158, August 1992.
T. D. Chandra, V. Hadzillacos, S. Toueg and B. Charron-Bost. “On the Impossibility of Group Membership”. Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 322–330, May 1996.
M. J. Fisher, N. A. Lynch and M. S. Paterson. “Impossibility of Distributed Consensus with One Faulty Process”. Journal of the ACM 32-2 pp. 374–382, April 1985.
C.A.R. Hoare. “Communicating Sequential Processes”. CACM 21-8 pp. 666–677, 1978.
F. Kroger. “Temporal Logic of Programs”. Springer Verlag, 1987.
P. LeMahieu and J. Bruck. “A Consistent History Link Connectivity Protocol”. Proceedings of the Seventeenth A CM Symposium on Principles of Distributed Computing, ACM Press, p. 309, July 1998 (extended abstract). Full version paper appeared in the Proceedings of the Thirteenth International Parallel Processing Symposium (IPPS 99).
N. Lynch. “Distributed Algorithms”. Morgan Kaufman, 1996.
A.J. Martin. “The Probe: An Addition to Communication Primitives”. Information Processing Letters 20 pp. 125–130, 1985.
G. Neiger. “A New Look at Membership Services”. Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 331–340, May 1996.
A. M. Ricciardi and K. P. Birman. “Using Process Groups to Implement Failure Detection in Asynchronous Environments”. Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 341–352, May 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Franceschetti, M., Bruck, J. (2000). On the Possibility of Group Membership Protocols. In: Avresky, D.R. (eds) Dependable Network Computing. The Springer International Series in Engineering and Computer Science, vol 538. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4549-1_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4549-1_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7053-6
Online ISBN: 978-1-4615-4549-1
eBook Packages: Springer Book Archive