Paging on a RAM with limited resources

DOI10.1007/3-540-45471-3_43MaRDI QIDQ3046519zbMATH OpenOpenAlexFDO

Authors Tony W. Lai

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45471-3_43

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Competitive analysis of randomized paging algorithms
• A strongly competitive randomized paging algorithm
• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
• OnlineMin: a fast strongly competitive randomized paging algorithm
• Competitive paging algorithms

Cited in

(2)

• Engineering efficient paging algorithms
• Minimizing Cache Usage in Paging

This page was built for publication: Paging on a RAM with limited resources

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