Paging with Request Sets

DOI10.1007/11785293_14MaRDI QIDQ5757877zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee, Tami Tamir

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11785293_14

Mathematics Subject Classification ID

Theory of operating systems (68N25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Paging with request sets
• Paging more than one page
• Paging more than one page
• scientific article; zbMATH DE number 1305389
• scientific article; zbMATH DE number 1559590

Cited in

(7)

• Paging more than one page
• Upper bounds for multi-level multi-server paging
• Paging with request sets
• Caching with time windows and delays
• Paging more than one page
• Online paging with heterogeneous cache slots
• Online paging with heterogeneous cache slots

This page was built for publication: Paging with Request Sets

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