简单有效的领导人选举

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA) Pub Date : 2018-01-01 DOI:10.4230/OASIcs.SOSA.2018.9

P. Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach

{"title":"简单有效的领导人选举","authors":"P. Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach","doi":"10.4230/OASIcs.SOSA.2018.9","DOIUrl":null,"url":null,"abstract":"We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"1 1","pages":"9:1-9:11"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":"{\"title\":\"Simple and Efficient Leader Election\",\"authors\":\"P. Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach\",\"doi\":\"10.4230/OASIcs.SOSA.2018.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.\",\"PeriodicalId\":93491,\"journal\":{\"name\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"volume\":\"1 1\",\"pages\":\"9:1-9:11\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/OASIcs.SOSA.2018.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/OASIcs.SOSA.2018.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 34

摘要

我们提供了一个简单而有效的群体协议，用于领导人选举，它使用O(log n)个状态，并在O(n (log n)^2)个高概率和期望的交互中恰好选出一个领导人。我们的分析很简单，基于基本的随机论证。我们的协议结合了Alistarh和Gelashvili (ICALP'15)基于锦标赛的领先者淘汰，以及Alistarh等人(SODA'17)引入的合成硬币。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Simple and Efficient Leader Election

We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)

自引率

0.00%

发文量