OPTIMAL RESILIENT DISTRIBUTED ALGORITHMS FOR RING ELECTION

Authors
Citation
My. Chan et Fyl. Chin, OPTIMAL RESILIENT DISTRIBUTED ALGORITHMS FOR RING ELECTION, IEEE transactions on parallel and distributed systems, 4(4), 1993, pp. 475-480
Citations number
18
Categorie Soggetti
System Science","Computer Applications & Cybernetics","Engineering, Eletrical & Electronic
ISSN journal
10459219
Volume
4
Issue
4
Year of publication
1993
Pages
475 - 480
Database
ISI
SICI code
1045-9219(1993)4:4<475:ORDAFR>2.0.ZU;2-D
Abstract
This paper considers the problem of electing a leader in a dynamic rin g in which processors are permitted to fail and recover during electio n. Theta(n log n + k(r)) messages, when counting only messages sent by functional processors, are shown to be necessary and sufficient for d ynamic ring election, where k(r) is the number of processor recoveries experienced.