New protocols for the election of a leader in a ring

DOI10.1016/0304-3975(87)90018-1zbMath0627.68028OpenAlexW2059506535MaRDI QIDQ1092653

B. George

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90018-1

zbMATH Keywords

distributed environmentcommunication-time characteristicsprotocol schema

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Improved bounds for electing a leader in a synchronous ring ⋮ Time vs bits ⋮ On the Microscopic View of Time and Messages

Cites Work

• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle