A group membership algorithm with a practical specification

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 11, 2001, Pages 1190-1200

  Franceschetti, Massimo ^a,b   Bruck, Jehoshua ^a,b  

^a IEEE   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asynchronous systems; Distributed agreement algorithms; Group membership

Indexed keywords

ASYNCHRONOUS SYSTEMS; CRASH FAILURES; DISTRIBUTED AGREEMENT ALGORITHMS; GROUP MEMBERSHIP PROBLEM;

COMPUTER PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; FAILURE ANALYSIS; MEMBERSHIP FUNCTIONS; NETWORK PROTOCOLS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

ALGORITHMS;

EID: 0035509517     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.969128     Document Type: Article

References (54)

1. The totem single-ring ordering and membership protocol
2. Membership algorithms for multicast communication groups
3. On the formal specification of group membership services
4. Scalable group membership services for novel applications
5. Relacs: A communication infrastructure for constructing reliable applications in large-scale distributed systems
6. Failure detectors, group membership and view synchronous communication in partitionable asynchronous systems
7. Group communication in partitionable systems: Specifications and algorithms
8. Another advantage of free choice: Completely asynchronous agreement protocols
9. Reliable communication in the presence of failures
10. Computing in the RAIN: A reliable array of independent nodes
11. Resilient consensus protocols
12. The tandem global update protocol
13. Unreliable failure detectors for reliable distributed systems
14. The weakest failure detector for solving consensus
15. On the impossibility of group membership
16. Reaching agreement on processor group membership in synchronous distributed systems
17. Probabilistic clock synchronization
18. Synchronous and asynchronous group communication
19. The timed asynchronous distributed system model
20. Agreeing on processor group membership in timed asynchronous distributed systems
21. The transis approach to high availability cluster communication
22. An asynchronous membership protocol that tolerates partitions
23. A framework for partitionable membership services
24. Consensus in the presence of partial synchrony
25. Specifying and using a partitionable group communication service
26. Impossibility of distributed consensus with one faulty process
27. On the possibility of group membership
28. Dynamic voting for maintaining the consistency of a replicated database
29. Processor group membership protocols: Specification, design and implementation
30. Communicating sequential processes
31. Group communication in the amoeba distributed system
32. A client server oriented algorithm for virtually synchronous group membership in WANs
33. A consistent history link connectivity protocol
34. Fault-tolerant switched local area networks
35. Dynamic voting for consistent primary components
36. Phoenix: A toolkit for building fault-tolerant distributed applications in large scale networks
37. View synchronous communication in large scale distributed systems
38. The probe: An addition to communication primitives
39. Compiling communicating processes into delay-insensitive VLSI circuits
40. Programming in VLSI: From communicating processes to delay-insensitive circuits
41. Processor membership in asynchronous distributed systems
42. Extended virtual synchrony
43. Totem: A fault tolerant multicast group communication system
44. A new look at membership services
45. The group membership problem in asynchronous systems
46. Using process groups to implement failure detection in asynchronous environments
47. Process membership in asynchronous environments
48. Experiences with the amoeba distributed operating system
49. Horus: A flexible group communication system
50. Group communication specifications: A comprehensive study