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

最优动态分布式MIS

Optimal Dynamic Distributed MIS

Keren Censor-Hillel, Elad Haramaty, Zohar Karnin

摘要:

在图中寻找最大独立集(MIS)是分布式计算中的一项重要任务。MIS的局部性质允许在静态分布式设置中快速解决方案,其在节点数量或其程度上是对数的。这一结果对于动态分布模型是很适用的,在动态分布模型中,边或节点可以被插入或删除。在本文中,我们采取了不同的方法,利用当地的极端,并展示了如何更新MIS在一个动态的分布式设置,无论是\emph{synchronous}或\emph{asynchronous},只有\emph{a single adjustment}和在一个单一的回合,在预期中。这些强有力的保证适用于\emph{complete fully dynamic}设置:边和节点的插入和删除,优雅而突然。这强烈地分离了静态和动态分布式模型,因为在前者中存在用于计算MIS的超常数下限。我们的研究结果是通过一种新的分析,仔细模拟贪婪的\emph{sequential} MIS算法的节点的随机排序的令人惊讶的简单的解决方案。因此,我们的算法有一个直接的应用程序作为一个$3$ -近似算法的相关聚类。这增加了分布式图分解的重要工具箱,分布式图分解被广泛用作分布式计算中的关键构建块。最后,我们的算法享有一个有用的\emph{history-independence}属性,这意味着输出是独立的拓扑结构的变化,构建该图的历史。这意味着输出不能被对手选择,甚至不能被对手偏见,以防对手的目标是阻止我们优化某些目标函数。

英文摘要:

Finding a maximal independent set (MIS) in a graph is a cornerstone task in distributed computing. The local nature of an MIS allows for fast solutions in a static distributed setting, which are logarithmic in the number of nodes or in their degrees. The result trivially applies for the dynamic distributed model, in which edges or nodes may be inserted or deleted. In this paper, we take a different approach which exploits locality to the extreme, and show how to update an MIS in a dynamic distributed setting, either \emph{synchronous} or \emph{asynchronous}, with only \emph{a single adjustment} and in a single round, in expectation. These strong guarantees hold for the \emph{complete fully dynamic} setting: Insertions and deletions, of edges as well as nodes, gracefully and abruptly. This strongly separates the static and dynamic distributed models, as super-constant lower bounds exist for computing an MIS in the former. Our results are obtained by a novel analysis of the surprisingly simple solution of carefully simulating the greedy \emph{sequential} MIS algorithm with a random ordering of the nodes. As such, our algorithm has a direct application as a $3$-approximation algorithm for correlation clustering. This adds to the important toolbox of distributed graph decompositions, which are widely used as crucial building blocks in distributed computing. Finally, our algorithm enjoys a useful \emph{history-independence} property, meaning the output is independent of the history of topology changes that constructed that graph. This means the output cannot be chosen, or even biased, by the adversary in case its goal is to prevent us from optimizing some objective function.

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

↑