On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A new look at membership services (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
ACM SIGOPS Operating Systems Review
Enriched View Synchrony: A Programming Paradigm for Partitionable Asynchronous Distributed Systems
IEEE Transactions on Computers
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The message classification model
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Client-Access Protocols for Replicated Services
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
EW 7 Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications
A Group Membership Algorithm with a Practical Specification
IEEE Transactions on Parallel and Distributed Systems
Muteness Failure Detectors: Specification and Implementation
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Enhancing Replica Management Services to Cope with Group Failures
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
Theoretical Computer Science - Special issue: Distributed computing
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Transient failures, unknown scheduling strategies and variable loads on the computing and communication resources give rise to an asynchronous and partitionable characterization for practical distributed systems with large geographic extent. We consider the group membership problem in partitionable asynchronous systems and give a formal specification that guarantees liveness and prevents capricious view splitting. Our work is based on the notion of reachability as an appropriate characterization of failures in partitionable systems in that it subsumes both process crashes and communication failures. The group membership problem is formulated in the context of view synchrony that includes a reliable multicast service for communication within the group. Our specification is modular and includes properties governing group membership separately from those governing reliable multicasts. It can be taken either partially for defining a group membership service alone, or taken as a whole for defining view synchrony.