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.
展开▼
机译：讨论了在动态环中选举领导者的问题，在该环中，允许处理器在选举期间发生故障并可以恢复。结果表明，仅对功能处理器发送的消息进行计数的theta（n log n + k / sub r /）消息对于动态环选举是必要且充分的，其中k / sub r /是经历的处理器恢复次数。
展开▼
