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

通过梯度下降实现加权流时间最小化的在线调度

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization

Qingyun Chen, Sungjin Im, Aditya Petety

AI总结:

本文提出一种基于SRPT推广的在线调度元算法,利用残差最优值的超模性,通过线性规划求解实现加权流时间最小化的可扩展调度,并首次为拟阵调度等问题给出可扩展算法。

摘要:

本文探讨了最短剩余处理时间(SRPT)的一种自然推广如何成为在线调度中强大的元算法。该元算法处理作业以最大程度地降低剩余作业对应离线调度问题的目标值:即最小化剩余作业的总加权完成时间(残差最优值)。我们证明,当残差最优值表现出超模性时,该元算法能够在最小化总加权流时间方面实现可扩展性。这里的可扩展性是指,在相对于对手具有任意小的加速优势下,算法具有O(1)竞争比,代表了在各种调度问题中可实现的最佳结果。得益于这一发现,我们的方法不要求残差最优值具有封闭的数学形式。因此,我们可以通过求解线性规划来获得调度方案,这使得我们的方法能够直接应用于丰富的应用场景。此外,通过建立与瓦尔拉斯市场中替代估值的新颖联系,我们展示了如何实现超模性,从而为各种调度问题获得可扩展算法,例如拟阵调度、广义网络流和广义任意加速曲线等,并且对于其中许多问题而言,这是首个非平凡或可扩展的算法。

英文摘要:

In this paper, we explore how a natural generalization of Shortest Remaining Processing Time (SRPT) can be a powerful \emph{meta-algorithm} for online scheduling. The meta-algorithm processes jobs to maximally reduce the objective of the corresponding offline scheduling problem of the remaining jobs: minimizing the total weighted completion time of them (the residual optimum). We show that it achieves scalability for minimizing total weighted flow time when the residual optimum exhibits \emph{supermodularity}. Scalability here means it is $O(1)$-competitive with an arbitrarily small speed augmentation advantage over the adversary, representing the best possible outcome achievable for various scheduling problems. Thanks to this finding, our approach does not require the residual optimum to have a closed mathematical form. Consequently, we can obtain the schedule by solving a linear program, which makes our approach readily applicable to a rich body of applications. Furthermore, by establishing a novel connection to \emph{substitute valuations in Walrasian markets}, we show how to achieve supermodularity, thereby obtaining scalable algorithms for various scheduling problems, such as matroid scheduling, generalized network flow, and generalized arbitrary speed-up curves, etc., and this is the \emph{first} non-trivial or scalable algorithm for many of them.

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

↑