arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06872cs.DCcs.DS
收藏

人口方案快速

Population Protocols Are Fast

Adrian Kosowski, Przemysław Uznański

摘要:

人口协议描述了一组状态变化规则的人口$n$不可区分的有限状态代理(自动机),经历随机成对的相互作用。在这个非常基本的框架内,可以解决分布式计算中的一些基本任务,包括:领导者选举,群体的聚合和阈值函数,例如多数计算和多数共识。对于第一次,我们表明,所有这些问题的解决方案可以得到\emph{quickly}使用有限状态协议。对于任意输入,所设计的有限状态协议在公平随机调度器下收敛到在期望的$O(\mathrm{poly} \log n)$并行时间内以高概率正确的输出。在相同的设置中,我们还显示协议总是达到一个有效的解决方案,在预期的并行时间$O(n^\varepsilon)$,其中的相互作用的自动机的状态数只取决于$\varepsilon>0$的选择。规定的时间范围适用于在总体方案框架中可计算的\emph{any}半线性等同器械。我们的研究结果的关键成分是分散设计的相位时钟的层次结构,在不同的速率滴答,与相邻时钟的频率分开的一个因素的$Θ(\log n)$。这个时钟层次结构的建设依赖于一个新的协议组合技术,结合自组织过程的振荡动力学的适应分析。这种时钟层次结构用于提供嵌套的同步原语,这使我们能够以全局方式查看种群,并使用具有(有限)循环和分支指令容量的高级命令式程序设计语言设计协议。

英文摘要:

A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of fundamental tasks in distributed computing, including: leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus. For the first time, we show that solutions to all of these problems can be obtained \emph{quickly} using finite-state protocols. For any input, the designed finite-state protocols converge under a fair random scheduler to an output which is correct with high probability in expected $O(\mathrm{poly} \log n)$ parallel time. In the same setting, we also show protocols which always reach a valid solution, in expected parallel time $O(n^\varepsilon)$, where the number of states of the interacting automata depends only on the choice of $\varepsilon>0$. The stated time bounds hold for \emph{any} semi-linear predicate computable in the population protocol framework. The key ingredient of our result is the decentralized design of a hierarchy of phase-clocks, which tick at different rates, with the rates of adjacent clocks separated by a factor of $Θ(\log n)$. The construction of this clock hierarchy relies on a new protocol composition technique, combined with an adapted analysis of a self-organizing process of oscillatory dynamics. This clock hierarchy is used to provide nested synchronization primitives, which allow us to view the population in a global manner and design protocols using a high-level imperative programming language with a (limited) capacity for loops and branching instructions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑