Membership algorithms for asynchronous distributed systems

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.<
>