arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.07532cs.DC
收藏

并行平衡分配:重负载情况

Parallel Balanced Allocations: The Heavily Loaded Case

Christoph Lenzen, Merav Parter, Eylon Yogev

摘要:

我们研究了经典的球到箱问题,其中$m$球作为单独的代理并行放置到$n$箱的并行算法。算法在同步轮中运行,在每个轮中,球和箱子交换一次消息。目标是使用少量的轮和少量的消息来最小化所有bin上的最大负载。虽然$m=n$球的情况已被广泛研究,但对重载情况知之甚少。在这项工作中,我们认为并行算法有点被忽视的制度$m\gg n$。将每个球分配到均匀且独立随机选择的箱的简单解决方案导致最大负载$m/n+Θ(\sqrt{m/n\cdot \log n})$(对于$m\geq n \log n$)w.h.p.相反,对于序贯设置,Berenbrink等人(SIAM J.Comput 2006)表明,让每个球加入两个随机选择的仓中的最小负载仓将最大负载降低到$m/n+O(\log\log m)$ w.h.p.。迄今为止,这种结果的平行变体是未知的。我们提出了一个简单的并行阈值算法,获得最大负载的$m/n+O(1)$ w.h.p.内$O(\log\log (m/n)+\log^* n)$轮。该算法是对称的(球和箱都“看起来一样”),球在每轮预期中发送$O(1)$消息。已知复杂度中的加性项$O(\log^* n)$对于此类算法是紧的(Lenzen和Wattenhofer Distributed Computing 2016)。我们还证明了我们的分析是严密的,即,我们提供的这种类型的算法必须运行$Ω(\min\{\log\log (m/n),n\})$轮w.h.p.。最后,我们给出一个简单的非对称算法(即,球知道容器的公共标记),其在恒定数量的轮w.h. p中实现$m/n + O(1)$的最大负载。同样,球每轮仅发送单个消息,并且容器接收$(1+o(1))m/n+O(\log n)$消息w.h. p。

英文摘要:

We study parallel algorithms for the classical balls-into-bins problem, in which $m$ balls acting in parallel as separate agents are placed into $n$ bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages. While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel algorithms for this somewhat neglected regime of $m\gg n$. The naive solution of allocating each ball to a bin chosen uniformly and independently at random results in maximal load $m/n+Θ(\sqrt{m/n\cdot \log n})$ (for $m\geq n \log n$) w.h.p. In contrast, for the sequential setting Berenbrink et al (SIAM J. Comput 2006) showed that letting each ball join the least loaded bin of two randomly selected bins reduces the maximal load to $m/n+O(\log\log m)$ w.h.p. To date, no parallel variant of such a result is known. We present a simple parallel threshold algorithm that obtains a maximal load of $m/n+O(1)$ w.h.p. within $O(\log\log (m/n)+\log^* n)$ rounds. The algorithm is symmetric (balls and bins all "look the same"), and balls send $O(1)$ messages in expectation per round. The additive term of $O(\log^* n)$ in the complexity is known to be tight for such algorithms (Lenzen and Wattenhofer Distributed Computing 2016). We also prove that our analysis is tight, i.e., algorithms of the type we provide must run for $Ω(\min\{\log\log (m/n),n\})$ rounds w.h.p. Finally, we give a simple asymmetric algorithm (i.e., balls are aware of a common labeling of the bins) that achieves a maximal load of $m/n + O(1)$ in a constant number of rounds w.h.p. Again, balls send only a single message per round, and bins receive $(1+o(1))m/n+O(\log n)$ messages w.h.p.

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

↑