Competitive Paging Algorithms
数据结构与算法
2015-06-02 v1 网络与互联网体系结构
摘要
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k.
引用
@article{arxiv.cs/0205038,
title = {Competitive Paging Algorithms},
author = {Amos Fiat and Richard Karp and Mike Luby and Lyle McGeoch and Daniel Sleator and Neal E. Young},
journal= {arXiv preprint arXiv:cs/0205038},
year = {2015}
}