A fail-aware membership service
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We propose a new protocol that can be used to implement a partitionable membership service for timed asynchronous systems. The protocol is fail-aware in the sense that a process p knows at all times if its approximation of the set of processes in its partition is up-to-date or out-of-date. The protocol minimizes wrong suspicions of processes by giving processes a second chance to stay in the membership before they are removed. Our measurements show that the exclusion of live processes is rare and the crash detection times are good. The protocol guarantees that the memberships of two partitions never overlap.Keywords
This publication has 9 references indexed in Scilit:
- Processor group membership protocols: specification, design and implementationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Properties of membership servicesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A highly available local leader election serviceIEEE Transactions on Software Engineering, 1999
- On the impossibility of group membershipPublished by Association for Computing Machinery (ACM) ,1996
- Fail-awareness in timed asynchronous systemsPublished by Association for Computing Machinery (ACM) ,1996
- A Membership Protocol Based on Partial OrderPublished by Springer Nature ,1992
- Reaching agreement on processor-group membrship in synchronous distributed systemsDistributed Computing, 1991
- Using process groups to implement failure detection in asynchronous environmentsPublished by Association for Computing Machinery (ACM) ,1991
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985