Limited bookmark randomized online algorithms for the paging problem

https://doi.org/10.1016/S0020-0190(00)00140-XGet rights and content

Abstract

An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is 32-competitive against an oblivious adversary. The algorithm keeps track of at most one page in slow memory at any time. A lower bound of 3724≈1.5416 is given for the competitiveness of any trackless online algorithm for the same problem, i.e., an algorithm that keeps track of no page outside the cache.

References (10)

There are more references available in the full text version of this article.

Cited by (0)

1

Research supported by NSF grant CCR-9821009.

View full text