Leader Election in Asymmetric Labeled Unidirectional Rings
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)(2017)
摘要
We study (deterministic) leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. In this context, we show that there is no algorithm that solves process-terminating leader election for the class of asymmetric labeled rings. In particular, there is no process-terminating leader election algorithm in rings in which at least one label is unique. However, we show that process-terminating leader election is possible for the subclass of asymmetric rings, where multiplicity is bounded. We confirm this positive results by proposing two algorithms, which achieve the classical trade-off between time and space.
更多查看译文
关键词
Leader Election,Homonym Processes,Multiplicity,Unidirectional Rings
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要