scientific article; zbMATH DE number 1303544

MaRDI QIDQ4250168zbMATH OpenFDO

Authors Neal E. Young

Publication date 17 June 1999

zbMATH Keywords

file cachingretrieval cost

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Recommendations

• On-line file caching
• On-line algorithm of loose competitive caching
• On variants of file caching
• scientific article; zbMATH DE number 1305389

Cited in

(33)

• Connection caching: Model and algorithms.
• A formula for incorporating weights into scoring rules
• On-line file caching
• Page replacement with multi-size pages and applications to web caching
• Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
• Online file caching with rejection penalties
• Calculating lower bounds for caching problems
• scientific article; zbMATH DE number 1617255 (Why is no real title available?)
• Randomized competitive algorithms for generalized caching
• Competitive algorithms for restricted caching and matroid caching
• On variants of file caching
• Online Compression Caching
• Cost-Aware Caching Algorithms for Distributed Storage Servers
• Object Caching for Queries and Updates
• scientific article; zbMATH DE number 4049014 (Why is no real title available?)
• scientific article; zbMATH DE number 1305389 (Why is no real title available?)
• An \(O(\log k)\)-competitive algorithm for generalized caching
• scientific article; zbMATH DE number 1875407 (Why is no real title available?)
• scientific article; zbMATH DE number 1875410 (Why is no real title available?)
• scientific article; zbMATH DE number 2119649 (Why is no real title available?)
• Application-Controlled Paging for a Shared Cache
• On-line algorithm of loose competitive caching
• An \(O(\log k)\)-competitive algorithm for generalized caching
• On paging with locality of reference
• Online paging and file caching with expiration times
• New results on web caching with request reordering
• An on-line algorithm to optimize file layout in a dynamic environment
• Paging and the address-translation problem
• Distributional online weighted paging with limited horizon
• Improved bounds for online balanced graph re-partitioning
• A universal online caching algorithm based on pattern matching
• Online hierarchical cooperative caching
• Paging with connections: FIFO strikes again

This page was built for publication:

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