DocumentCode :
3556951
Title :
Membership algorithms for asynchronous distributed systems
Author :
Moser, Louise E. ; Melliar-Smith, P.M. ; Agrawala, Vivek
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
fYear :
1991
fDate :
20-24 May 1991
Firstpage :
480
Lastpage :
488
Abstract :
Algorithms for solving the processor membership problem in asynchronous distributed systems that are subject to processor and communication faults are presented. These algorithms are based on the placement of a total order on broadcast messages. The types of systems for which each of these algorithms is appropriate are characterized in terms of the properties of the communication mechanisms and the availability of stable storage. In the absence of stable storage or a mechanism for distinguishing promptly delivery messages, it is shown that no membership algorithm exists
Keywords :
distributed processing; fault tolerant computing; network operating systems; asynchronous distributed systems; broadcast messages; communication faults; communication mechanisms; delivery messages; membership algorithms; processor faults; processor membership problem; stable storage; Algorithm design and analysis; Availability; Broadcasting; Casting; Fault tolerant systems; Marine vehicles; Mechanical factors; Protocols; Real time systems; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1991., 11th International Conference on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-2144-3
Type :
conf
DOI :
10.1109/ICDCS.1991.148713
Filename :
148713
Link To Document :
بازگشت