arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.5963cs.DCcs.LO
收藏

无限网络、停止和局部算法

Infinite Networks, Halting and Local Algorithms

Antti Kuusisto

摘要:

最近,人们对局部算法的兴趣越来越大,即,常数时间分布算法在最近的一项调查(Suomela,ACM Computing Surveys,2013)中,有人认为局部算法提供了一个自然的框架,可以用来在有限时间内控制无限网络。我们研究了一个全面的收集分布式计算模型,并证明,如果无限网络包括在调查的结构类,那么每个普遍停止分布式算法实际上是一个本地算法。为了对比这一结果,我们表明,如果只允许有限的网络,那么即使是非常弱的分布式计算模型可以定义非本地算法,停止无处不在。本文中的调查继续了在逻辑和分布式计算的交叉中的研究(Hella等人,PODC 2012)和(Kuusisto,CSL 2013)。

英文摘要:

The immediate past has witnessed an increased amount of interest in local algorithms, i.e., constant time distributed algorithms. In a recent survey of the topic (Suomela, ACM Computing Surveys, 2013), it is argued that local algorithms provide a natural framework that could be used in order to theoretically control infinite networks in finite time. We study a comprehensive collection of distributed computing models and prove that if infinite networks are included in the class of structures investigated, then every universally halting distributed algorithm is in fact a local algorithm. To contrast this result, we show that if only finite networks are allowed, then even very weak distributed computing models can define nonlocal algorithms that halt everywhere. The investigations in this article continue the studies in the intersection of logic and distributed computing initiated in (Hella et al., PODC 2012) and (Kuusisto, CSL 2013).

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

↑