The worst page-replacement policy

DOI10.1007/S00224-008-9114-1MaRDI QIDQ2272194zbMATH OpenOpenAlexFDO

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

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

cachingcompetitive analysisonline algorithmspage replacement

Mathematics Subject Classification ID

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

Recommendations

• The Worst Page-Replacement Policy
• On-Line Paging Against Adversarially Biased Random Inputs
• On the separation and equivalence of paging strategies
• A strongly competitive randomized paging algorithm
• The relative worst-order ratio applied to paging

Cites work

• A strongly competitive randomized paging algorithm
• Cache-oblivious algorithms
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Competitive paging with locality of reference
• scientific article; zbMATH DE number 53772 (Why is no real title available?)
• scientific article; zbMATH DE number 1445384 (Why is no real title available?)
• Random sampling with a reservoir

Cited in

(2)

• scientific article; zbMATH DE number 3537218 (Why is no real title available?)
• The Worst Page-Replacement Policy

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

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