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

自适应箱删除下的负载均衡

Load Balancing under Adaptive Bin Deletions

Google Research(谷歌研究);Tel Aviv University(特拉维夫大学);Weizmann Institute of Science(魏茨曼科学研究所)

Haim Kaplan, Shay Sapir, Uri Stemmer

AI总结:

研究自适应对手顺序删除箱子时的球箱游戏,证明n/2轮后均匀随机重分配有最优资源与负载,“二选一”可降负载,还探讨变体,表明d = 1面对自适应对手不行,d = 2可实现线性资源与有效负载均衡。

摘要:

我们分析了一种针对顺序删除箱子的自适应对手的球箱游戏。从分布在n个箱子中的n个球开始,对手在每一步删除一个箱子,迫使算法将其球重新分配到幸存的箱子中。我们证明,在n/2轮之后,均匀随机重新分配产生最优的O(n)资源和O((log n)/(log log n))的最大负载。此外,我们表明应用“二选一”可将最大负载降低到O(log log n),同时保持线性资源。我们还考虑了此游戏的一种变体,其中已删除箱子中的球均匀地分配到d << n个随机箱子中,而不是独立重新分配。我们证明,将球集中在一起(d = 1),这在面对遗忘对手时给出小的最大负载和资源,但在面对自适应对手时失败。然而,我们表明将球分成两组(d = 2)足以在自适应设置中恢复线性资源和有效的负载均衡。

英文摘要:

We analyze a balls-and-bins game against an adaptive adversary that sequentially deletes bins. Starting with $n$ balls distributed across $n$ bins, the adversary deletes a bin in each step, forcing the algorithm to redistribute its balls to surviving bins. We prove that after $n/2$ rounds, uniform random redistribution yields optimal $O(n)$ recourse and $O(\frac{\log n}{\log \log n})$ maximum load. Furthermore, we show that applying the ``power of two choices'' reduces the maximum load to $O(\log \log n)$ while maintaining linear recourse. We also consider a variation of this game where the balls from the deleted bin are partitioned evenly among $d \ll n$ random bins rather than being redistributed independently. We demonstrate that keeping the balls together ($d=1$), which gives small maximum load and recourse against an oblivious adversary, fails against an adaptive adversary. Nevertheless, we show that splitting the balls into just two groups ($d=2$) is sufficient to recover linear recourse and efficient load balancing in the adaptive setting.

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

↑