Consider a setting where processors ane not associated with unique identifiers but the total number of processors is known and the processors are onganized along a bidirectional ring.Is it possible to derive an election algorithm for such a setting?
问题信息
-
扫描二维码，关注牛客网
- 意见反馈
-
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
- 求职之前，先上牛客
-
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
- 公司地址：北京市朝阳区北苑路北美国际商务中心K1座一层-北京牛客科技有限公司
- 联系方式：010-60728802 投诉举报电话：010-57596212（朝阳人力社保局）
- 牛客科技© All rights reserved admin@nowcoder.com
- 京ICP备14055008号-4 增值电信业务经营许可证 营业执照 人力资源服务许可证
-
京公网安备
11010502036488号
It is impossible to elect a leader in a deterministic manner when the processors do not contain unique identifers.Since different processors have no distinguishing mark,they are assumed to start in the same state and transmit and receive the same messages in every timestep.Hence,there is no way to distinguish the processors even after an arbitarily lange number of timesteps.