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

休眠是有效的:$O(1)$中的MIS-轮节点平均唤醒复杂度

Sleeping is Efficient: MIS in $O(1)$-rounds Node-averaged Awake Complexity

Soumyottam Chatterjee, Robert Gmyr, Gopal Pandurangan

摘要:

最大独立集问题是分布式计算的基本问题之一。分布式MIS的轮(时间)复杂度传统上集中在所有节点完成的\emph{worst-case time}上。最著名的(随机化)MIS算法在一般图上取$O(\log{n})$最坏情况的轮次(其中$n$是节点数)。出于减少\emph{total}在能量受限的网络,如传感器和ad hoc无线网络的能源消耗的目标,我们采取另一种方法来测量性能。我们专注于最小化所有节点完成的总时间(或者等价地,\emph{average})。目前还不清楚目前最著名的算法是否产生恒定轮(甚至$o(\log{n})$)节点平均轮复杂度的MIS在一般的图。我们将\emph{sleeping model},传统模型的推广,允许节点进入"睡眠“或"唤醒”状态在任何一轮。虽然唤醒状态对应于传统模型中的默认状态,但在睡眠状态下,节点是"离线“的,即,它不发送或接收消息(并且发送给它的消息也被丢弃),并且不引起任何时间、通信或本地计算成本。因此,在这个模型中,只计算节点处于唤醒状态的轮次,我们感兴趣的是最小化节点处于唤醒状态的平均轮次数和最坏情况下的轮次数。我们的主要结果是,我们表明,{ \em MIS可以解决(预期)$O(1)$轮下节点平均清醒复杂性措施}在睡眠模型。特别是,我们提出了一个随机分布式算法的MIS,预期{ \em $O(1)$ -轮节点平均唤醒复杂度},并具有很高的概率有{ \em $O(\log{n})$ -轮最坏情况下的唤醒复杂度}和{ \em $O(\log^{3.41}n)$ -轮最坏情况下的复杂度}。

英文摘要:

Maximal Independent Set (MIS) is one of the fundamental problems in distributed computing. The round (time) complexity of distributed MIS has traditionally focused on the \emph{worst-case time} for all nodes to finish. The best-known (randomized) MIS algorithms take $O(\log{n})$ worst-case rounds on general graphs (where $n$ is the number of nodes). Motivated by the goal to reduce \emph{total} energy consumption in energy-constrained networks such as sensor and ad hoc wireless networks, we take an alternative approach to measuring performance. We focus on minimizing the total (or equivalently, the \emph{average}) time for all nodes to finish. It is not clear whether the currently best-known algorithms yield constant-round (or even $o(\log{n})$) node-averaged round complexity for MIS in general graphs. We posit the \emph{sleeping model}, a generalization of the traditional model, that allows nodes to enter either ``sleep'' or ``waking'' states at any round. While waking state corresponds to the default state in the traditional model, in sleeping state a node is ``offline'', i.e., it does not send or receive messages (and messages sent to it are dropped as well) and does not incur any time, communication, or local computation cost. Hence, in this model, only rounds in which a node is awake are counted and we are interested in minimizing the average as well as the worst-case number of rounds a node spends in the awake state. Our main result is that we show that {\em MIS can be solved in (expected) $O(1)$ rounds under node-averaged awake complexity measure} in the sleeping model. In particular, we present a randomized distributed algorithm for MIS that has expected {\em $O(1)$-rounds node-averaged awake complexity} and, with high probability has {\em $O(\log{n})$-rounds worst-case awake complexity} and {\em $O(\log^{3.41}n)$-rounds worst-case complexity}.

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

↑