Fast Space Optimal Leader Election in Population Protocols
Fast Space Optimal Leader Election in Population Protocols
复制标题
群体协议中的快速空间最优领导者选举
DOI：
10.1137/1.9781611975031.169
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Grzegorz Stachowiak
中科院分区：
文献类型：
--
作者：
L. Gąsieniec;Grzegorz Stachowiak
人口协议的模型是指广受欢迎的理论框架的日益增长，适用于在大量简单无法区分的实体中研究成对相互作用，通常称为代理。在本文中，重点是通过由随机调度程序控制的人口协议的快速领导者选举的空间复杂性，该规划仪在随机的随机选择中均匀地选择了n个代理人中的成对相互作用。
本文的主要结果是新的快速和空间最佳领导者选举协议。新协议利用O（log^2 n）并行时间（相当于O（n log^2 n）顺序成对相互作用），并且每个代理都在O（log log log n）状态下运行。此双对数空间使用情况渐近地匹配了任何领导者选举算法中代理所需的最小数量的下限1/2 log log n，其运行时间o（n/polylog n）。
我们的解决方案利用了相时钟的概念，这是分布式计算中的基本同步和协调工具。我们提出了一种新的快速，强大的人群协议，以以多种模式同时运行相时钟的初始化，并与领导者选举过程交织在一起。我们还为读者提供了相关的形式论证，表明我们的解决方案始终是正确的，并且可能具有很高的可能性。
The model of population protocols refers to the growing in popularity theoretical framework suitable for studying pairwise interactions within a large collection of simple indistinguishable entities, frequently called agents. In this paper the emphasis is on the space complexity in fast leader election via population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions within the population of n agents.
The main result of this paper is a new fast and space optimal leader election protocol. The new protocol utilises O(log^2 n) parallel time (which is equivalent to O(n log^2 n) sequential pairwise interactions), and each agent operates on O(log log n) states. This double logarithmic space usage matches asymptotically the lower bound 1/2 log log n on the minimal number of states required by agents in any leader election algorithm with the running time o(n/polylog n).
Our solution takes an advantage of the concept of phase clocks, a fundamental synchronisation and coordination tool in distributed computing. We propose a new fast and robust population protocol for initialisation of phase clocks to be run simultaneously in multiple modes and intertwined with the leader election process. We also provide the reader with the relevant formal argumentation indicating that our solution is always correct, and fast with high probability.
DOI：
10.1137/1.9781611974782.169
发表时间：
2016-02
期刊：
ArXiv
影响因子：
--
作者：
Dan Alistarh;J. Aspnes;David Eisenstat;Rati Gelashvili;R. Rivest
通讯作者：
Dan Alistarh;J. Aspnes;David Eisenstat;Rati Gelashvili;R. Rivest