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

流水作业时间排序与前缀Beck-Fiala

Flow Time Scheduling and Prefix Beck-Fiala

Nikhil Bansal, Lars Rohwedder, Ola Svensson

摘要:

我们与经典的调度问题,最大流时间和总流时间不相关的机器上最小化的差异理论。具体而言,我们给出了一个一般的减少,使我们能够转移的前缀贝克Fiala(有界$\ell_1$规范)设置的界限上的流动时间的最佳时间表的差异界限。结合我们的约简和Banaszczyk通过凸几何证明的一个深入结果,分别给出了最大流时间和总流时间的$O(\sqrt{\log n})$和$O(\sqrt{\log n} \log P)$的保证,改进了以前的$O(\log n)$和$O(\log n \log P)$的最佳保证.除了改进的保证,减少激励看似简单的版本的前缀差异问题:前缀贝克-Fiala的任何常数约束,其中向量具有稀疏性2(稀疏性1是平凡的)已经产生了严格的保证最大流时间和总流时间。虽然已知的技术解决这种情况下,当条目采取值在$\{-1,0,1\}$,我们表明,他们是不可能转移到更一般的$2$ -稀疏的情况下,有界$\ell_1$ -范数。

英文摘要:

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bounded $\ell_1$-norm) setting to bounds on the flow time of an optimal schedule. Combining our reduction with a deep result proved by Banaszczyk via convex geometry, give guarantees of $O(\sqrt{\log n})$ and $O(\sqrt{\log n} \log P)$ for max flow time and total flow time, respectively, improving upon the previous best guarantees of $O(\log n)$ and $O(\log n \log P)$. Apart from the improved guarantees, the reduction motivates seemingly easy versions of prefix discrepancy questions: any constant bound on prefix Beck-Fiala where vectors have sparsity two (sparsity one being trivial) would already yield tight guarantees for both max flow time and total flow time. While known techniques solve this case when the entries take values in $\{-1,0,1\}$, we show that they are unlikely to transfer to the more general $2$-sparse case of bounded $\ell_1$-norm.

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

↑