Competitive analysis of randomized paging algorithms

DOI10.1007/3-540-61680-2_72zbMath1379.68376OpenAlexW2168823865MaRDI QIDQ4595503

John Noga, Marek Chrobak, Demetrios Achlioptas

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_72

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27)

Related Items

The working set algorithm has competitive ratio less than two ⋮ Connection caching: Model and algorithms. ⋮ A randomized algorithm for two servers on the line. ⋮ Trackless online algorithms for the server problem ⋮ Limited bookmark randomized online algorithms for the paging problem

This page was built for publication: Competitive analysis of randomized paging algorithms