在线算法中的时间局部性
Temporal Locality in Online Algorithms
摘要:
在线算法根据过去的输入做出决策。一般而言,该决定可以取决于输入的整个历史。如果许多计算机使用相同的输入流运行相同的在线算法,但在不同的时间启动,则它们不一定会做出一致的决策。在这项工作中,我们引入时间本地在线算法。这些是在线算法,其中给定时间的输出仅取决于$T = O(1)$最新的输入。在分布式环境中使用(确定性)时间局部算法自动导致全局一致的决策。我们的关键观察是,时间局部在线算法(在给定时间的输出仅取决于时间维度上的本地输入)与局部分布式图算法(给定节点的输出仅取决于空间维度上的本地输入)密切相关。这使得有可能从在线算法的角度来解释分布式图算法的先前工作。我们描述了一种算法的合成方法,可以用来设计最佳的时间局部在线算法的小值的$T$。我们证明了该技术的力量的上下文中的一个变种的在线文件迁移问题,并表明,例如,对于两个节点和单位迁移成本存在一个$3$ -竞争力的时间本地算法的地平线$T=4$,而没有确定性的在线算法(在经典意义上)可以做得更好。我们还推导出一个更一般的版本的问题的上限和下限,我们表明,有一个$6$竞争确定性时间本地算法和$2.62$竞争随机时间本地算法的任何迁移成本$α\ge 1$。
英文摘要:
Online algorithms make decisions based on past inputs. In general, the decision may depend on the entire history of inputs. If many computers run the same online algorithm with the same input stream but are started at different times, they do not necessarily make consistent decisions. In this work we introduce time-local online algorithms. These are online algorithms where the output at a given time only depends on $T = O(1)$ latest inputs. The use of (deterministic) time-local algorithms in a distributed setting automatically leads to globally consistent decisions. Our key observation is that time-local online algorithms (in which the output at a given time only depends on local inputs in the temporal dimension) are closely connected to local distributed graph algorithms (in which the output of a given node only depends on local inputs in the spatial dimension). This makes it possible to interpret prior work on distributed graph algorithms from the perspective of online algorithms. We describe an algorithm synthesis method that one can use to design optimal time-local online algorithms for small values of $T$. We demonstrate the power of the technique in the context of a variant of the online file migration problem, and show that e.g. for two nodes and unit migration costs there exists a $3$-competitive time-local algorithm with horizon $T=4$, while no deterministic online algorithm (in the classic sense) can do better. We also derive upper and lower bounds for a more general version of the problem; we show that there is a $6$-competitive deterministic time-local algorithm and a $2.62$-competitive randomized time-local algorithm for any migration cost $α\ge 1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。