The Complexity of Paging Against a Probabilistic Adversary.
Proceedings of the 42nd International Conference on SOFSEM 2016: Theory and Practice of Computer Science - Volume 9587(2016)
摘要
We consider deterministic online algorithms for paging. The offline version of the paging problem, in which the whole input is given in advance, is known to be easily solvable. If the input is random, chosen according to some known probability distribution, an $$\mathcal {O}\mathopen {}\left \log k\right $$-competitive algorithm exists. Moreover, there are distributions, where no algorithm can be better than $$\mathrm {\Omega }\mathopen {}\left \log k\right $$-competitive. In this paper, we ask the question of what happens if it is known that the input is one from a set of $$\ell $$ potential candidates, chosen according to some probability distribution. We present an $$\mathcal {O}\mathopen {}\left \log \ell \right $$-competitive algorithm, and show a matching lower bound.
更多查看译文
关键词
Competitive Ratio,Online Algorithm,Competitive Algorithm,Page Fault,Online Problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要