在存在局部初始知识的情况下迈向奇异最优性
Towards singular optimality in the presence of local initial knowledge
AI总结:
本文研究分布式CONGEST模型中局部初始知识对算法性能的影响,提出在KT2 CONGEST模型下构造danner的新方法,显著改善了时间与消息复杂度之间的权衡。
摘要:
Knowledge Till rho CONGEST模型是分布式计算中经典CONGEST模型的一个变体,其中每个顶点v初始时掌握以v为中心的半径为rho的球体内的知识。CONGEST模型最常被研究的变体是KT0 CONGEST和KT1 CONGEST:在KT0 CONGEST中,节点初始时对其邻居一无所知;在KT1 CONGEST中,节点初始时知道所有邻居的ID。已有研究表明,能够获取邻居ID(如KT1 CONGEST模型)可以显著降低诸如BROADCAST和MST等基本问题的算法的消息复杂度。例如,King、Kutten和Thorup(PODC 2015)展示了如何在KT1 CONGEST模型中仅使用Otilde(n)条消息构造MST,而在KT0 CONGEST模型中MST存在Omega(m)的消息下界。在此结果的基础上,Gmyr和Pandurangen(DISC 2018)提出了一族用于各种全局问题的分布式随机算法,这些算法在消息复杂度和轮复杂度之间表现出一种权衡。这些算法基于构造一个称为danner的稀疏生成子图。具体而言,给定一个图G以及任意delta属于[0,1],他们的算法(以高概率)构造出一个danner,其直径为Otilde(D + n^{1-delta}),边数为Otilde(min{m,n^{1+delta}}),运行轮数为Otilde(n^{1-delta}),同时使用的消息数为Otilde(min{m,n^{1+δ}}),其中n、m和D分别是G的节点数、边数和直径。在本文的主要结果中,我们证明如果假设KT2 CONGEST模型,则有可能在构造danner时大幅改善时间-消息权衡。具体而言,我们证明在KT2 CONGEST模型中,对于任意delta属于[0,1/2],如何构造一个danner,其直径为Otilde(D + n^{1-2delta}),边数为Otilde(min{m,n^{1+delta}}),运行轮数为Otilde(n^{1-2delta}),同时使用的消息数为Otilde(min{m,n^{1+δ}})。
英文摘要:
The Knowledge Till rho CONGEST model is a variant of the classical CONGEST model of distributed computing in which each vertex v has initial knowledge of the radius-rho ball centered at v. The most commonly studied variants of the CONGEST model are KT0 CONGEST in which nodes initially know nothing about their neighbors and KT1 CONGEST in which nodes initially know the IDs of all their neighbors. It has been shown that having access to neighbors' IDs (as in the KT1 CONGEST model) can substantially reduce the message complexity of algorithms for fundamental problems such as BROADCAST and MST. For example, King, Kutten, and Thorup (PODC 2015) show how to construct an MST using just Otilde(n) messages in the KT1 CONGEST model, whereas there is an Omega(m) message lower bound for MST in the KT0 CONGEST model. Building on this result, Gmyr and Pandurangen (DISC 2018) present a family of distributed randomized algorithms for various global problems that exhibit a trade-off between message and round complexity. These algorithms are based on constructing a sparse, spanning subgraph called a danner. Specifically, given a graph G and any delta in [0,1], their algorithm constructs (with high probability) a danner that has diameter Otilde(D + n^{1-delta}) and Otilde(min{m,n^{1+delta}}) edges in Otilde(n^{1-delta}) rounds while using Otilde(min{m,n^{1+δ}}) messages, where n, m, and D are the number of nodes, edges, and the diameter of G, respectively. In the main result of this paper, we show that if we assume the KT2 CONGEST model, it is possible to substantially improve the time-message trade-off in constructing a danner. Specifically, we show in the KT2 CONGEST model, how to construct a danner that has diameter Otilde(D + n^{1-2delta}) and Otilde(min{m,n^{1+delta}}) edges in Otilde(n^{1-2delta}) rounds while using Otilde(min{m,n^{1+δ}}) messages for any delta in [0,1/2].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。