Issue No. 04 - April (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219762
<p>The problem of electing a leader in a dynamic ring in which processors are permitted tofail and recover during election is discussed. It is shown that theta (n log n+k/sub r/)messages, counting only messages sent by functional processors, are necessary andsufficient for dynamic ring election, where k/sub r/ is the number of processor recoveriesexperienced.</p>
Index Termsmessage complexity; distributed algorithms; ring election; dynamic ring; processorrecoveries; computational complexity; multiprocessing systems; system recovery
F. Chin and M. Chan, "Optimal Resilient Distributed Algorithms for Ring Election," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 475-480, 1993.