An Efficient Fault-tolerant Membership Protocol
Original Publication Date: 1986-Dec-01
Included in the Prior Art Database: 2005-Mar-09
An efficient fault-tolerant protocol for computing the processor membership of a dynamically-evolving distributed processor system is proposed. The proposed protocol guarantees finite processor failure and join detection delays, provides all correctly functioning processors with identical membership information a any local clock time, is tolerant of any number of likely faults except network partitioning, and has minimal run-time overhead when no faults occur. In addition, while assuming no shared storage among processors, the protocol scales well when the number of processors of a system increases.