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

可变处理器杯游戏

The Variable-Processor Cup Game

William Kuszmaul, Alek Westover

摘要:

在$p$处理器上调度任务,使任何任务都不会落后太远的问题通常被描述为杯子和水的游戏。在$n$杯子上的$p$ -处理器杯子游戏中,有两个玩家,一个填充者和一个清空者,轮流从一组$n$杯子中添加和移除水。在每一轮中,填充器向杯子中添加$p$单位的水,在每个杯子中放置最多$1$单位的水,然后清空者选择$p$杯子以从其中移除最多$1$单位的水。清空者的目标是最小化积压,这是最满的杯子的高度。$p$ -处理器杯游戏已经在许多不同的设置中进行了研究,可以追溯到20世纪60年代后期。所有过去的工作都有一个共同的假设:$p$是固定的。本文开始研究当可用处理器$p$的数量随时间变化时会发生什么,从而产生我们所谓的\emph{variable-processor cup game}。值得注意的是,可变处理器杯游戏的最佳界限显着不同,从它的经典对应。而$p$ -处理器杯具有最佳积压$Θ(\log n)$,可变处理器游戏具有最佳积压$Θ(n)$。此外,存在一种有效的填充策略,该策略在准多项式时间内产生积压$Ω(n^{1 - ε})$,以对抗任何确定性清空策略。我们还表明,直接使用的随机化不能用来帮助清空。具体地,对于任何正常数$Δ$和任何$Δ$ -贪婪样随机化清空算法$\mathcal{A}$,存在在准多项式时间中相对于$\mathcal{A}$实现积压$Ω(n^{1 - ε})$的填充策略。

英文摘要:

The problem of scheduling tasks on $p$ processors so that no task ever gets too far behind is often described as a game with cups and water. In the $p$-processor cup game on $n$ cups, there are two players, a filler and an emptier, that take turns adding and removing water from a set of $n$ cups. In each turn, the filler adds $p$ units of water to the cups, placing at most $1$ unit of water in each cup, and then the emptier selects $p$ cups to remove up to $1$ unit of water from. The emptier's goal is to minimize the backlog, which is the height of the fullest cup. The $p$-processor cup game has been studied in many different settings, dating back to the late 1960's. All of the past work shares one common assumption: that $p$ is fixed. This paper initiates the study of what happens when the number of available processors $p$ varies over time, resulting in what we call the \emph{variable-processor cup game}. Remarkably, the optimal bounds for the variable-processor cup game differ dramatically from its classical counterpart. Whereas the $p$-processor cup has optimal backlog $Θ(\log n)$, the variable-processor game has optimal backlog $Θ(n)$. Moreover, there is an efficient filling strategy that yields backlog $Ω(n^{1 - ε})$ in quasi-polynomial time against any deterministic emptying strategy. We additionally show that straightforward uses of randomization cannot be used to help the emptier. In particular, for any positive constant $Δ$, and any $Δ$-greedy-like randomized emptying algorithm $\mathcal{A}$, there is a filling strategy that achieves backlog $Ω(n^{1 - ε})$ against $\mathcal{A}$ in quasi-polynomial time.

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

↑