Competitive Paging Algorithms

@article{Fiat1991CompetitivePA,
  title={Competitive Paging Algorithms},
  author={Amos Fiat and Richard M. Karp and Michael Luby and Lyle A. McGeoch and Daniel Dominic Sleator and N. Young},
  journal={ArXiv},
  year={1991},
  volume={cs.DS/0205038}
}

A strongly competitive randomized paging algorithm

The partitioning algorithm is developed, a randomized on-line algorithm for the paging problem, which it is proved that its expected cost on any sequence of requests is within a factor ofHk of optimum.

Notes for Lecture 21 1 Randomized Paging Algorithms

A lower bound of k is shown for the competitive ratio of any deterministic algorithm, thus establishing that the marking algorithms are optimal deterministic algorithms.

Paging on a RAM with Limited Resources

A novel k-competitive deterministic algorithm called Surely Not Recently used (SNRU) that approximates the Least Recently Used (LRU) algorithm and an implementation of the randomized marking algorithm of Fiat et al. that uses only k + o(k) bits of space while supporting page requests in O(1) worst-case time.

Competitive Analysis of Paging

  • S. Irani
  • Computer Science
    Online Algorithms
  • 1996
This chapter surveys the competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized on-line algorithm. We then go

Competive Analysis of Randomized Paging Algorithms

This paper provides a new, H k -competitive algorithm for paging, which is simpler than the known algorithm by McGeoch and Sleator and can be implemented with complexity bounds independent of the number of past requests.

Paging with Request Sets

It is shown that for any u>1 the offline problem is NP-hard and hard to approximate if the cache size k is part of the input, but solvable in polynomial time for constant values of k.

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms

This paper addresses the conjecture that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, and proposes an algorithm, denoted Partition2, which is a variant of the Partition algorithm in [3], while Partition is unbounded in its space requirements, Partitions2 uses Θ(k/logk)bookmarks.

On-Line caching tis Cache

Reconsider the competitiveness of on-line strategies using k servers versus the optimal off-line strategy using h S k servers for the paging, weighted cache, and k-server problems and shows that for the weighted cache prc~blem the balance algorithm is --competitive.

On-line caching as cache size varies

It is shown that when h < k the competitiveness of the marking algorithm, arandomized paging strategy, is no more than 2(ln ~ –lnln ~+~) when & > e, and at most 2 otherwise, and it is shown this is roughly within a factor of two of optimal.
...

References

SHOWING 1-10 OF 33 REFERENCES

On-line caching as cache size varies

It is shown that when h < k the competitiveness of the marking algorithm, arandomized paging strategy, is no more than 2(ln ~ –lnln ~+~) when & > e, and at most 2 otherwise, and it is shown this is roughly within a factor of two of optimal.

Amortized efficiency of list update and paging rules

This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.

New results on server problems

A fast algorithm for oflline computing of an optimal schedule is given, and it is shown that finding an optimal offline schedule is at least as hard as the assignment problem.

Competitive randomized algorithms for nonuniform problems

New randomized on-line algorithms for snoopy caching and the spin-block problem are presented and achieve competitive ratios approachinge/(e−1) ≈ 1.58 against an oblivious adversary, a surprising improvement over the best possible ratio in the deterministic case.

Competitive algorithms for on-line problems

This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.

Competitive snoopy caching

This work presents new on-line algorithms to be used by the caches of snoopy cache multiprocessor systems to decide which blocks to retain and which to drop in order to minimize communication over the bus.

A competitive 3-server algorithm

This work proves that a simple, natural randomized algorithm is competitive for the 3-server problem, where to serve a request is to move one of the k servers to the request site.

An optimal online algorithm for metrical task systems

A general model for the processing of sequences of tasks and a general online decision algorithm are introduced and it is shown that this algorithm is optimal among all online algorithms.

Competitive k-server algorithms

Deterministic competitive k-server algorithms are given for all k and all metric spaces and the competitive ratio can be proved is exponential in the number of servers, settling the k- server conjecture.