Competitive Paging Algorithms
<|reference_start|>Competitive Paging Algorithms: 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.<|reference_end|>
@article{fiat2002competitive,
    title={Competitive Paging Algorithms},
    author={Amos Fiat, Richard Karp, Mike Luby, Lyle McGeoch, Daniel Sleator, Neal
  E. Young},
    journal={Journal of Algorithms 12:685-699 (1991)},
    year={2002},
    doi={10.1016/0196-6774(91)90041-V},
    archivePrefix={arXiv},
    eprint={cs/0205038},
    primaryClass={cs.DS cs.NI}
}