Leader Election In Rings With Bounded Multiplicity (Short Paper)

Karine Altisen,Ajoy K. Datta,Stephane Devismes,Anais Durand,Lawrence L. Larmore

Lecture Notes in Computer Science（2016）

引用 3|浏览22

暂无评分

摘要

We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings K-k with bounded multiplicity k >= 2. However, we show that process-terminating leader election is possible in the sub-class u* boolean AND K-k, where u* is the class of rings which contain a process with a unique label.

查看译文

关键词

Leader Election Problem, Unidirectional Ring, Unique Label, Ring Network, Asynchronous Message-passing Model

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要