On the influence of lookahead in competitive paging algorithms
From MaRDI portal
Publication:1361407
DOI10.1007/PL00009158zbMATH Open0879.68046OpenAlexW2121033525MaRDI QIDQ1361407FDOQ1361407
Authors: Susanne Albers 
Publication date: 17 December 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009158
Recommendations
- On competitive on-line paging with lookahead
- On competitive on-line paging with lookahead
- Competitive analysis of randomized paging algorithms
- Competitive analysis of randomized paging algorithms
- Competitive paging algorithms
- On the relative dominance of paging algorithms
- On the Relative Dominance of Paging Algorithms
- scientific article; zbMATH DE number 1379109
- scientific article; zbMATH DE number 1830729
- Competitive analysis of the LRFU paging algorithm
Cited In (28)
- A competitive analysis of the list update problem with lookahead
- Real-time integrated prefetching and caching
- On the power of lookahead in on-line server routing problems
- A competitive analysis of the list update problem with lookahead
- Measuring the problem-relevant information in input
- An optimal algorithm for 2-bounded delay buffer management with lookahead
- Competitive caching of query results in search engines
- Online-bounded analysis
- Randomized online multi-threaded paging
- On competitive on-line paging with lookahead
- On competitive on-line paging with lookahead
- The relative worst-order ratio applied to paging
- On the power of lookahead in online lot-sizing
- Exact distributional analysis of online algorithms with lookahead
- Combining request scheduling with web caching
- A new measure for the study of on-line algorithms
- Topology matters: smoothed competitiveness of metrical task systems
- Online bounded analysis
- Online Algorithms for Weighted Paging with Predictions
- Paging more than one page
- Approximating the discrete resource sharing scheduling problem
- Analysis of simple randomized buffer management for parallel I/O
- Scheduling unit length jobs on parallel machines with lookahead information
- On the Relative Dominance of Paging Algorithms
- On the relative dominance of paging algorithms
- On the separation and equivalence of paging strategies and other online algorithms
- Online packet scheduling with bounded delay and lookahead
- How much is it worth to know the future in online conversion problems?
This page was built for publication: On the influence of lookahead in competitive paging algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361407)
