Optimal resilient distributed algorithms for ring election

Emerging

5
Citations
18
Refs
1993
Year
Search Works
Work Details
  • DOI 10.1109/71.219762
  • OpenAlex ID W2130812063
  • Type Article
  • Language EN
  • Published 01 Apr 1993
  • Volume 4 (4)
  • Pages 475–480
  • Source IEEE Transactions on Parallel and Distri…
  • Publisher Institute of Electrical and Electro…
  • FWCI 0.53
  • Countries 1
  • Institutions 1
  • Added 24 Jun 2016
  • Updated 16 Oct 2026
External Links
OpenAlex Record DOI Resolver
MENU
0

Optimal resilient distributed algorithms for ring election

Article 1993 EN

The problem of electing a leader in a dynamic ring in which processors are permitted to fail 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 and sufficient for dynamic ring election, where k/sub r/ is the number of processor recoveries experienced.>

5

Citations

18

References

2

Authors

0.53

FWCI

Citations by Year
Last 2 years
Topics
Keywords
Authors & Affiliations
2 authors
#AuthorInstitutionsORCID
1 M.Y. Chan University of Hong Kong (HK) —
2 Francis Y. L. Chin University of Hong Kong (HK) —
Related Works
10

Data: OpenAlex