arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.01722cs.DScs.DMmath.CO
收藏

可变处理机杯对策的最优时间-积压权衡

Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game

William Kuszmaul, Shyam Narayanan

摘要:

\emph{$ p$-processor cup game}是一个经典的和广泛研究的调度问题,捕获设置中,一个$p$处理器的机器必须分配任务的处理器随着时间的推移,以确保没有个别任务永远落后太多。该问题被形式化为一个多轮游戏,其中两个玩家,一个填充器(谁分配工作的任务)和一个emptier(谁安排任务)竞争。清空者的目标是最小化积压,积压是任何任务的最大未完成工作量。最近,Kuszmaul和Westover(ITCS,2021)提出了\emph{variable-processor cup game},它考虑了同样的问题,除了玩家可用的资源量(即,处理器的数量$p$)在游戏的回合之间波动。他们表明,这个看似很小的修改从根本上改变了游戏的动态:在固定处理器的$p$游戏中,最佳积压是独立于$p$的$Θ(\log n)$,而在可变处理器的游戏中,最佳积压是$Θ(n)$。后一个结果只适用于\emph{exponentially many}回合的游戏,然而,对于较短的游戏,时间和积压之间的最佳权衡是什么仍然是一个悬而未决的问题。本文建立了一个紧凑的权衡曲线之间的时间和积压在可变处理器杯游戏。重要的是,我们证明了一个游戏组成的$t$轮,最佳的积压是$Θ(n)$当且仅当$t \ge Ω(n^3)$。我们的技术还允许我们解决其他几个悬而未决的问题,关于如何在超越最坏情况分析设置的可变处理器杯游戏的行为。

英文摘要:

The \emph{$ p$-processor cup game} is a classic and widely studied scheduling problem that captures the setting in which a $p$-processor machine must assign tasks to processors over time in order to ensure that no individual task ever falls too far behind. The problem is formalized as a multi-round game in which two players, a filler (who assigns work to tasks) and an emptier (who schedules tasks) compete. The emptier's goal is to minimize backlog, which is the maximum amount of outstanding work for any task. Recently, Kuszmaul and Westover (ITCS, 2021) proposed the \emph{variable-processor cup game}, which considers the same problem, except that the amount of resources available to the players (i.e., the number $p$ of processors) fluctuates between rounds of the game. They showed that this seemingly small modification fundamentally changes the dynamics of the game: whereas the optimal backlog in the fixed $p$-processor game is $Θ(\log n)$, independent of $p$, the optimal backlog in the variable-processor game is $Θ(n)$. The latter result was only known to apply to games with \emph{exponentially many} rounds, however, and it has remained an open question what the optimal tradeoff between time and backlog is for shorter games. This paper establishes a tight trade-off curve between time and backlog in the variable-processor cup game. Importantly, we prove that for a game consisting of $t$ rounds, the optimal backlog is $Θ(n)$ if and only if $t \ge Ω(n^3)$. Our techniques also allow for us to resolve several other open questions concerning how the variable-processor cup game behaves in beyond-worst-case-analysis settings.

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

↑