群体协议模型中对数期望时间领袖选举

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-12-29 DOI:10.1145/3293611.3331585

Y. Sudo, Fukuhito Ooshita, Taisuke Izumi, H. Kakugawa, T. Masuzawa

{"title":"群体协议模型中对数期望时间领袖选举","authors":"Y. Sudo, Fukuhito Ooshita, Taisuke Izumi, H. Kakugawa, T. Masuzawa","doi":"10.1145/3293611.3331585","DOIUrl":null,"url":null,"abstract":"In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m ≥ = log2 n and m=O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Logarithmic Expected-Time Leader Election in Population Protocol Model\",\"authors\":\"Y. Sudo, Fukuhito Ooshita, Taisuke Izumi, H. Kakugawa, T. Masuzawa\",\"doi\":\"10.1145/3293611.3331585\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m ≥ = log2 n and m=O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.\",\"PeriodicalId\":153766,\"journal\":{\"name\":\"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3293611.3331585\",\"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 2019 ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3293611.3331585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

本文提出了一种群体协议模型中的领导者选举协议，该协议期望在O(log n)个并行时间内稳定，每个agent有O(log n)个状态，其中n为agent的个数。给定种群大小n的大致知识m，使得m≥= log2n, m=O(log n)，该协议保证只有一个leader被选出，并且唯一的leader将永远保留。

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

查看原文本刊更多论文

Logarithmic Expected-Time Leader Election in Population Protocol Model

In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m ≥ = log2 n and m=O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.

求助全文

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

来源期刊

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

自引率

0.00%

发文量