arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.05445cs.DC
收藏

共享随机性有助于局部分布式问题

Shared Randomness Helps with Local Distributed Problems

Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto

AI总结:

本文构造了一个 LCL 问题,证明共享随机性确实能带来严格优势:该问题在私有随机性下需要 Ω(√n) 轮,而在共享随机性下仅需 O(log n) 轮,并由此解决了分布式计算中的多个开放问题。

摘要:

根据先前的工作,我们有许多与可以用局部约束定义的分布式图算法问题相关的结果;先前工作中使用的形式框架是局部可检查标记问题(LCL),由 Naor 和 Stockmeyer 在 1990 年代引入。例如,已知如果我们有一个在 $o(\log n)$ 轮内解决 LCL 的确定性算法,我们可以将其加速到 $O(\log^*n)$ 轮;如果我们有一个随机化的 $O(\log^*n)$ 轮算法,我们可以免费地将其去随机化。\n\n还已知随机性对某些 LCL 问题有帮助:存在随机化复杂度为 $Θ(\log\log n)$ 而确定性复杂度为 $Θ(\log n)$ 的 LCL 问题。然而,到目前为止,还没有任何 LCL 问题必须使用共享随机性;在先前所有算法中,节点能够访问自己的私有随机性源就足够了。\n\n是否可能存在这样的情况:共享随机性对 LCL 从来没有帮助?我们是否能够有一种通用技术,将任何使用共享随机性的 LCL 分布式图算法转化为同样快速的、仅使用私有随机性就足够的算法?\n\n在这项工作中,我们证明了答案是否定的。我们提出一个 LCL 问题 $Π$,使得在具有私有随机性的通常随机化 \local 模型中,$Π$ 的轮复杂度为 $Ω(\sqrt n)$,但如果节点能够访问共享随机性源,则复杂度下降到 $O(\log n)$。\n\n作为推论,我们还解决了与 LCL 问题背景下分布式计算格局相关的其他几个开放问题。特别是,问题 $Π$ 证明了用于 LCL 问题的分布式量子算法严格受益于共享量子态。问题 $Π$ 还给出了有限依赖分布与非信号分布之间的分离。

英文摘要:

By prior work, we have many results related to distributed graph algorithms for problems that can be defined with local constraints; the formal framework used in prior work is locally checkable labeling problems (LCLs), introduced by Naor and Stockmeyer in the 1990s. It is known, for example, that if we have a deterministic algorithm that solves an LCL in $o(\log n)$ rounds, we can speed it up to $O(\log^*n)$ rounds, and if we have a randomized $O(\log^*n)$ rounds algorithm, we can derandomize it for free. It is also known that randomness helps with some LCL problems: there are LCL problems with randomized complexity $Θ(\log\log n)$ and deterministic complexity $Θ(\log n)$. However, so far there have not been any LCL problems in which the use of shared randomness has been necessary; in all prior algorithms it has been enough that the nodes have access to their own private sources of randomness. Could it be the case that shared randomness never helps with LCLs? Could we have a general technique that takes any distributed graph algorithm for any LCL that uses shared randomness, and turns it into an equally fast algorithm where private randomness is enough? In this work we show that the answer is no. We present an LCL problem $Π$ such that the round complexity of $Π$ is $Ω(\sqrt n)$ in the usual randomized \local model with private randomness, but if the nodes have access to a source of shared randomness, then the complexity drops to $O(\log n)$. As corollaries, we also resolve several other open questions related to the landscape of distributed computing in the context of LCL problems. In particular, problem $Π$ demonstrates that distributed quantum algorithms for LCL problems strictly benefit from a shared quantum state. Problem $Π$ also gives a separation between finitely dependent distributions and non-signaling distributions.

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

↑