A strongly competitive randomized paging algorithm
TL;DR: 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.
read more
Abstract: 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 ofH
k of optimum. (H
k 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Competitive paging algorithms
TL;DR: The marking 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 of 2Hk of optimum.
548
Competitive algorithms for server problems
TL;DR: This paper seeks to develop on-line algorithms whose performance on any sequence of requests is as close as possible to the performance of the optimum off-line algorithm.
530
•Book
The Design of Competitive Online Algorithms via a Primal-Dual Approach
Niv Buchbinder,Joseph (Seffi) Naor +1 more
- 11 May 2009
TL;DR: This survey shows in this survey how to extend the primal—dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems.
Competitive randomized algorithms for non-uniform problems
Anna R. Karlin,Mark S. Manasse,Lyle A. McGeoch,Susan S. Owicki +3 more
- 01 Jan 1990
TL;DR: 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.
Online coded caching
TL;DR: This work proposes an online coded caching scheme termed coded least-recently sent (LRS) and simulates it for a demand time series derived from the dataset made available by Netflix for the Netflix Prize, showing that the proposed coded LRS algorithm significantly outperforms the popular least- recently used caching algorithm.
References
Amortized efficiency of list update and paging rules
TL;DR: 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.
2.5K
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
Competitive paging algorithms
TL;DR: The marking 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 of 2Hk of optimum.
548
Competitive algorithms for server problems
TL;DR: This paper seeks to develop on-line algorithms whose performance on any sequence of requests is as close as possible to the performance of the optimum off-line algorithm.
530
Competitive algorithms for on-line problems
Mark S. Manasse,Lyle A. McGeoch,Daniel D. Sleator +2 more
- 01 Jan 1988
TL;DR: This paper presents several general results concerning competitive algorithms, as well as results on specific on-line problems.
452