On the influence of lookahead in competitive paging algorithms
From MaRDI portal
Publication:1361407
DOI10.1007/PL00009158zbMath0879.68046OpenAlexW2121033525MaRDI QIDQ1361407
Publication date: 17 December 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009158
Related Items (24)
Online-bounded analysis ⋮ Combining request scheduling with web caching ⋮ Competitive caching of query results in search engines ⋮ On the relative dominance of paging algorithms ⋮ Randomized online multi-threaded paging ⋮ Analysis of simple randomized buffer management for parallel I/O ⋮ Measuring the problem-relevant information in input ⋮ The relative worst-order ratio applied to paging ⋮ A competitive analysis of the list update problem with lookahead ⋮ On the power of lookahead in online lot-sizing ⋮ Paging more than one page ⋮ Real-time integrated prefetching and caching ⋮ Online packet scheduling with bounded delay and lookahead ⋮ How much is it worth to know the future in online conversion problems? ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ On the Relative Dominance of Paging Algorithms ⋮ APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ On the power of lookahead in on-line server routing problems ⋮ Online Bounded Analysis ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead ⋮ On competitive on-line paging with lookahead ⋮ Topology matters: smoothed competitiveness of metrical task systems
This page was built for publication: On the influence of lookahead in competitive paging algorithms
