A strongly competitive randomized paging algorithm

@article{McGeoch2005ASC,
  title={A strongly competitive randomized paging algorithm},
  author={Lyle A. McGeoch and Daniel Dominic Sleator},
  journal={Algorithmica},
  year={2005},
  volume={6},
  pages={816-825}
}
  • Lyle A. McGeoch, Daniel Dominic Sleator
  • Published in Algorithmica 2005
  • Computer Science
  • Thepaging problem is that of deciding which pages to keep in a memory ofk pages in order to minimize the number of page faults. We develop thepartitioning algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor ofHk of optimum. (Hk is thekth harmonic number, which is about ln(k).) No on-line algorithm can perform better by this measure. Our result improves by a factor of two the best previous algorithm. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 166 CITATIONS

    Randomization in On-line

    • AlgorithmsOctavian ProcopiucApril
    • 1998
    VIEW 16 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    The On-Line K-Server Problem

    VIEW 9 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Design of competitive paging algorithms with good behaviour in practice

    VIEW 11 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms

    VIEW 10 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Competitive cache replacement strategies for a shared cache

    VIEW 7 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Randomized algorithm for the k-server problem on decomposable spaces

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A randomized on-line algorithm for the k-server problem on a line

    VIEW 7 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Online algorithms for prefetching and caching on parallel disks

    VIEW 7 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    k-server problems with bulk requests: an application to tool switching in manufacturing

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    On Competitive On-Line Paging with Lookahead

    VIEW 4 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    1990
    2020

    CITATION STATISTICS

    • 24 Highly Influenced Citations

    • Averaged 7 Citations per year from 2017 through 2019

    References

    Publications referenced by this paper.