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

已知最大完工时间下的改进型在线负载均衡

Improved online load balancing with known makespan

Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall, Rob van Stee

AI总结:

针对已知最优完工时间的在线负载均衡(箱拉伸)问题,提出竞争比达13/93<1.495的算法,突破3/2的天然壁垒,分析结合尺寸与权重论证。

摘要:

我们突破了已知最大完工时间的在线负载均衡问题(又称bin stretching(箱拉伸)问题)的3/2性能壁垒。该问题给定m台相同机器以及最优最大完工时间。机器的负载为分配给它的所有作业的总大小,最大完工时间则是所有机器的最大负载。作业以在线方式到达,目标是将每个作业分配到某台机器上,同时使最终最大完工时间与最优最大完工时间的比值(即竞争比)保持在较小水平。我们提出一种算法,当m足够大时,其竞争比可维持在139/93<1.495,改进了此前3/2的上界。3/2是该问题的一个天然上界:只要在线箱子的大小至少为离线箱子的3/2,所有在离线箱子中至少能放两个的物品都具备两个良好性质——它们在在线箱子中能放三个,且单个此类物品可与任意大小的物品共同放入一个在线箱子。如今这两个性质均不再成立,这意味着哪怕将一个作业分配到错误的机器上,都可能导致最终有作业无法分配。这也使得为物品类型确定合适的阈值变得更困难,这是将竞争比降至3/2以下的主要技术难点之一。本研究的分析过程结合了精细的尺寸论证与权重论证。

英文摘要:

We break the barrier of $3/2$ for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, $m$ identical machines and the optimal makespan are given. The load of a machine is the total size of all the jobs assigned to it and the makespan is the maximum load of all the machines. Jobs arrive online and the goal is to assign each job to a machine while staying within a small factor (the competitive ratio) of the optimal makespan. We present an algorithm that maintains a competitive ratio of $139/93<1.495$ for sufficiently large values of $m$, improving the previous bound of $3/2$. The value 3/2 represents a natural bound for this problem: as long as the online bins are of size at least $3/2$ of the offline bin, all items that fit at least two times in an offline bin have two nice properties. They fit three times in an online bin and a single such item can be packed together with an item of any size in an online bin. These properties are now both lost, which means that putting even one job on a wrong machine can leave some job unassigned at the end. It also makes it harder to determine good thresholds for the item types. This was one of the main technical issues in getting below $3/2$. The analysis consists of an intricate mixture of size and weight arguments.

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

↑