Published 2000
| Version public
Book Section - Chapter
On the Possibility of Group Membership Protocols
Contributors
Other:
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.
Additional Information
© 2000 Springer Science+Business Media New York. 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.Additional details
Identifiers
- Eprint ID
- 100944
- DOI
- 10.1007/978-1-4615-4549-1_4
- Resolver ID
- CaltechAUTHORS:20200127-124216616
Related works
- Describes
- 10.1007/978-1-4615-4549-1_4 (DOI)
Funding
- NSF
- CCR-9457811
- Alfred P. Sloan Foundation
- IBM
- Defense Advanced Research Projects Agency (DARPA)
Dates
- Created
-
2020-01-28Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
Caltech Custom Metadata
- Series Name
- Springer International Series in Engineering and Computer Science
- Series Volume or Issue Number
- 538