Online min-max paging

DOI10.1137/1.9781611977554.CH57MaRDI QIDQ6538588zbMATH OpenFDO

Authors Ashish Chiplunkar, Monika R. Henzinger, Sagar Sudhir Kale, Maximilian Vötsch

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH57

Mathematics Subject Classification ID

Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27)

Recommendations

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• OnlineMin: a fast strongly competitive randomized paging algorithm
• A strongly competitive randomized paging algorithm
• On-line multi-threaded paging
• Competitive analysis of randomized paging algorithms

This page was built for publication: Online min-max paging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538588)