The worst page-replacement policy

DOI10.1007/s00224-008-9114-1zbMath1192.68811OpenAlexW2134189878MaRDI QIDQ2272194

Jeremy T. Fineman, Michael A. Bender, Kunal Agrawal

Publication date: 6 August 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9114-1

zbMATH Keywords

competitive analysisonline algorithmscachingpage replacement

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive analysis of randomized paging algorithms
• Competitive paging with locality of reference
• Cache-Oblivious Algorithms
• Random sampling with a reservoir
• Competitive paging algorithms

This page was built for publication: The worst page-replacement policy