Method for coordinating membership with asymmetric safety in a d

Details Method for coordinating membership with asymmetric safety in a d Method for coordinating membership with asymmetric safety in a d

1997-09-05

1999-07-13

Kizou, Hassan

G06F 1100

Patent

active

059238313

ABSTRACT:
A method is disclosed for coordinating membership subject to an asymmetric safety condition from multiple processes in a distributed system. Each is callable by a distributed application for system status or for executing tasks of the application. Initially, each process sends the other processes its view on their status, where the view includes the names of a group of the processes. It then waits for similar views from other processors except those regarded as failed in its own view, up to a predetermined timeout. Each process then generates a resulting view by intersecting its local view with the names of those processes from which it has received views. The local views are updated based on the resulting views and again exchanged until a termination condition occurs.

REFERENCES:
patent: 4342084 (1982-07-01), Sager et al.
patent: 5146605 (1992-09-01), Beukema et al.
patent: 5423044 (1995-06-01), Sutton et al.
patent: 5513354 (1996-04-01), Dwork et al.
patent: 5544345 (1996-08-01), Carpenter et al.
patent: 5550973 (1996-08-01), Forman et al.
patent: 5758052 (1998-05-01), Glowny et al.
patent: 5784550 (1998-07-01), Brockmann et al.
patent: 5802265 (1998-09-01), Bressoud et al.
patent: 5835697 (1998-11-01), Watabe et al.
S. Chaudhuri, "More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems." Information and Computation 105, 132-158 (1993).
D. Malki, "Uniform Actions in Asynchronous Distributed Systems," Journal of the Association for Computing Machinery, 0-89791-654-9/94/0008.
D. Dolev et al., "On the Minimal Synchronism Needed for Distributed Consensus," Journal of the Association for Computing Machinery, vol. 34, No. 1, Jan. 1987, pp. 77-97.
M. Herlihy et al., "Set Consensus Using Arbitrary Objects," ACM 0-89791-654-9/94/0008.
S. Chaudhuri et al., "Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation," Proceedings of the 10th International Workshop on Distributed Alogrithims, Italy, 1996.
M. Aguilera et al., "Randomization and Failure Detection: A Hybrid Approach to Solve Consensus," Proceeding of the 10th International Workshop on Distributed Algorithms. Italy, 1996.
G. Bracha et al., "Asynchronous Consensus and Broadcast Protocols," Journal of the Association for Computing Machinery, vol. 32, No. 4, Oct. 1985, pp. 824-840.
Butler W. Lampson, "How to Build a Highly Available System Using Consensus," 10th Annual Workshop-Distributed Algorithms, Italy, 1996.
M. Rosu, "Early-Stopping Terminating Reliable Broadcast Protocol for General-Omission Failure," Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, 1996.
T. Chandra, "Polylog Randomized Wait-Free Consensus," Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, 1996.
I. Keider et al., "Efficient Message Ordering in Dynamic Networks," Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, 1996.
T. Chandra et al., On the Impossibility of Group Membership, Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996.
G. Neiger, "A New Look at Membership Services," Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, 1996.
C. Dwork et al., "Collective Consistency," Proceedings of the 10th International Workshop on Distributed Algorithms, Italy, 1996.
T. Chandra et al., "Unreliable Failure Detectors for Asynchronous Systems," Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, 1991.
M. Ficsher et al., "Impossibility of Distributed Consensus with One Faulty Process," Journal of ACM 32(2), 1985.
D. Peleg et al., "Crumbling Walls: A Class of Practical and Efficient Quorum Systems," Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, 1995.
T. Chandra et al., "The Weakest Failure Detector for Solving Consensus," Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, 1992.
R. Anderson et al., "Wait-Free Parallel Algorithms for the Union-Find Problems," Proceedings of the 23rd ACM STOC, 1991.

Affiliated with

Also associated with

Rating

Method for coordinating membership with asymmetric safety in a d does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for coordinating membership with asymmetric safety in a d, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for coordinating membership with asymmetric safety in a d will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2285086