Page replacement with multi-size pages and applications to web caching

DOI10.1007/S00453-001-0125-4zbMATH Open0994.68184OpenAlexW2001850337MaRDI QIDQ1601029FDOQ1601029

Authors: R. Smith 

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0125-4

Recommendations

• scientific article; zbMATH DE number 1559590
• scientific article; zbMATH DE number 1305389
• On-line file caching
• An \(O(\log k)\)-competitive algorithm for generalized caching
• scientific article; zbMATH DE number 1303544

zbMATH Keywords

paging problemFAULT model

Mathematics Subject Classification ID

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

Cited In (18)

• Title not available (Why is that?)
• Caching is hard -- even in the fault model
• Online file caching with rejection penalties
• Resource Management in Large Networks
• On Certain New Models for Paging with Locality of Reference
• Title not available (Why is that?)
• Optimizing LRU Caching for Variable Document Sizes
• Optimal prepaging and font caching
• An \(O(\log k)\)-competitive algorithm for generalized caching
• Title not available (Why is that?)
• Caching is hard -- even in the fault model
• Cost-Aware Caching Algorithms for Distributed Storage Servers
• On variants of file caching
• Combining request scheduling with web caching
• Caching documents with variable sizes and fetching costs: an LP-based approach
• Dynamic balanced graph partitioning
• New results on web caching with request reordering
• Title not available (Why is that?)

This page was built for publication: Page replacement with multi-size pages and applications to web caching

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