Paging with request sets

DOI10.1007/S00224-007-9029-2zbMATH Open1192.68823OpenAlexW2142949082MaRDI QIDQ2272199FDOQ2272199

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

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

zbMATH Keywords

online algorithmscompetitive analysispaging

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Competitive snoopy caching
• Competitive analysis of randomized paging algorithms
• Competitive algorithms for server problems
• Competitive paging algorithms
• An optimal on-line algorithm for metrical task system
• A strongly competitive randomized paging algorithm
• A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
• On-line vertex-covering
• Title not available (Why is that?)
• Competitive algorithms for the weighted server problem

Cited In (7)

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