Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Temporal logic of programs
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Experiences with the Amoeba distributed operating system
Communications of the ACM
Programming in VLSI: from communicating processes to delay-insensitive circuits
Developments in concurrency and communication
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The group membership problem in asynchronous systems
The group membership problem in asynchronous systems
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
Communications of the ACM
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
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Dynamic voting for consistent primary components
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A consistent history link connectivity protocol
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Communicating sequential processes
Communications of the ACM
Computing in the RAIN: A Reliable Array of Independent Nodes
IEEE Transactions on Parallel and Distributed Systems
Building Secure and Reliable Network Applications
Building Secure and Reliable Network Applications
Distributed Algorithms
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
Processor Membership in Asynchronous Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Membership Algorithms for Multicast Communication Groups
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Tolerant Switched Local Area Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Group Communication in Partitionable Systems: Specification and Algorithms
Group Communication in Partitionable Systems: Specification and Algorithms
Group Membership and View Synchrony in Partitionable Asynchronous Distributed Systems: Specifications
From Set Membership to Group Membership: A Separation of Concerns
IEEE Transactions on Dependable and Secure Computing
The design and prototype of RUDA, a distributed grid accounting system
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.00 |
This paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet nontrivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under different models.