Paging with request sets

DOI10.1007/S00224-007-9029-2MaRDI QIDQ2272199zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Rob van Stee, Tami Tamir

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-007-9029-2

zbMATH Keywords

competitive analysisonline algorithmspaging

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

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

Cites work

• A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
• A strongly competitive randomized paging algorithm
• An optimal on-line algorithm for metrical task system
• Competitive algorithms for server problems
• Competitive algorithms for the weighted server problem
• Competitive analysis of randomized paging algorithms
• Competitive paging algorithms
• Competitive snoopy caching
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• On-line vertex-covering

Cited in

(8)

• Paging more than one page
• Upper bounds for multi-level multi-server paging
• The optimal structure of algorithms for \(\alpha\)-paging
• Caching with time windows and delays
• Paging more than one page
• Paging with Request Sets
• 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 Q2272199)