The Community for Technology Leaders
Green Image
<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.Y.L. Chin, M.Y. Chan, "Optimal Resilient Distributed Algorithms for Ring Election", IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 475-480, April 1993, doi:10.1109/71.219762
78 ms
(Ver 3.3 (11022016))