逆偏置随机输入下的在线寻呼
On-Line Paging against Adversarially Biased Random Inputs
摘要:
在评估算法时,最坏情况分析可能过于悲观。平均案例分析可能过于乐观。一个中间的方法是证明一个算法在一个广泛的输入分布类上做得很好。Koutsoupias和Papadimitriou最近以这种方式分析了最近最少使用(LRU)寻呼策略,分析了它在所谓的扩散对手(diffuse advertisement)生成的输入序列上的性能-扩散对手必须概率地选择每个请求,以便没有页面被选择的概率超过某个固定的概率>0。他们表明LRU达到了最佳竞争比(对于确定性在线算法),但他们没有确定实际的比率。在本文中,我们估计的最佳比例在大约两个因素的确定性策略(例如,最近最少使用和先进先出)和随机策略。在阈值Theta ~ 1/k(其中k是高速缓存大小)附近,最佳比率都是Theta(ln k)。在阈值以下,比率迅速趋于O(1)。在阈值以上,随机策略的比率不变,但确定性策略的比率迅速趋于Theta(k)。我们还给出了LRU的最优性的另一种证明。
英文摘要:
In evaluating an algorithm, worst-case analysis can be overly pessimistic. Average-case analysis can be overly optimistic. An intermediate approach is to show that an algorithm does well on a broad class of input distributions. Koutsoupias and Papadimitriou recently analyzed the least-recently-used (LRU) paging strategy in this manner, analyzing its performance on an input sequence generated by a so-called diffuse adversary -- one that must choose each request probabilitistically so that no page is chosen with probability more than some fixed epsilon>0. They showed that LRU achieves the optimal competitive ratio (for deterministic on-line algorithms), but they didn't determine the actual ratio. In this paper we estimate the optimal ratios within roughly a factor of two for both deterministic strategies (e.g. least-recently-used and first-in-first-out) and randomized strategies. Around the threshold epsilon ~ 1/k (where k is the cache size), the optimal ratios are both Theta(ln k). Below the threshold the ratios tend rapidly to O(1). Above the threshold the ratio is unchanged for randomized strategies but tends rapidly to Theta(k) for deterministic ones. We also give an alternate proof of the optimality of LRU.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。