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

唤醒复杂度为$O(\log\log{n} )$的分布式最大独立集(MIS)算法

Distributed MIS in $O(\log\log{n} )$ Awake Complexity

Fabien Dufoulon, William K. Moses, Gopal Pandurangan

AI总结:

针对分布式MIS算法轮复杂度长期难以突破$O(\log n)$的问题,提出两种随机分布式算法,在CONGEST模型下分别实现$O(\log\log n)$和$O((\log\log n)\log^*n)$的唤醒复杂度,以指数级优于现有轮复杂度下界。

摘要:

最大独立集(Maximal Independent Set, MIS)是分布式图算法中最基础、研究最广泛的问题之一。尽管历经四十年的深入研究,目前已知最优的(随机化)MIS算法在一般图上的轮复杂度为$O(\log{n})$[Luby, STOC 1986](其中$n$为节点数),而已知的最优下界为$\Omega(\sqrt{\log{n}/\log\log{n}})$[Kuhn, Moscibroda, Wattenhofer, JACM 2016]。突破$O(\log{n})$的轮复杂度上界,或是证明更强的下界,一直是长期悬而未决的问题。\n 我们的核心贡献在于证明:MIS的计算可以达到唤醒复杂度,该复杂度相较于已知最优的$O(\log n)$轮复杂度呈指数级提升,同时也以指数级突破了其$\Omega(\sqrt{\log{n}/\log\log{n}})$的基本轮复杂度下界。具体而言,我们提出一种随机分布式(蒙特卡洛)算法,能够以高概率(即概率至少为$1 - n^{-1}$)在$O(\log\log{n} )$的唤醒复杂度下计算出MIS,该算法的轮复杂度为$O((\log^7 n) \log \log n)$。我们还证明,可以通过略微提升唤醒复杂度来优化轮复杂度:我们提出另一种MIS随机分布式(蒙特卡洛)算法,在高概率下,其唤醒复杂度为$O((\log\log{n})\log^*n)$,轮复杂度为$O((\log^3 n) (\log \log n) \log^*n)$。我们的算法均在CONGEST模型下运行,该模型中每条边每轮可发送大小为$O(\log n)$比特的消息。

英文摘要:

Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best-known (randomized) MIS algorithms have $O(\log{n})$ round complexity on general graphs [Luby, STOC 1986] (where $n$ is the number of nodes), while the best-known lower bound is $Ω(\sqrt{\log{n}/\log\log{n}})$ [Kuhn, Moscibroda, Wattenhofer, JACM 2016]. Breaking past the $O(\log{n})$ round complexity upper bound or showing stronger lower bounds have been longstanding open problems. Our main contribution is to show that MIS can be computed in awake complexity that is exponentially better compared to the best known round complexity of $O(\log n)$ and also bypassing its fundamental $Ω(\sqrt{\log{n}/\log\log{n}})$ round complexity lower bound exponentially. Specifically, we show that MIS can be computed by a randomized distributed (Monte Carlo) algorithm in $O(\log\log{n} )$ awake complexity with high probability (i.e., with probability at least $1 - n^{-1}$). This algorithm has a round complexity of $O((\log^7 n) \log \log n)$. We also show that we can improve the round complexity at the cost of a slight increase in awake complexity, by presenting a randomized distributed (Monte Carlo) algorithm for MIS that, with high probability, computes an MIS in $O((\log\log{n})\log^*n)$ awake complexity and $O((\log^3 n) (\log \log n) \log^*n)$ round complexity. Our algorithms work in the CONGEST model where messages of size $O(\log n)$ bits can be sent per edge per round.

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

↑