Optimal prefetching via data compression

DOI10.1145/234752.234753MaRDI QIDQ4371687zbMATH OpenOpenAlexFDO

Authors

Publication date 22 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

cachingprefetching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Optimal Prediction for Prefetching in the Worst Case
• scientific article; zbMATH DE number 1003271
• Near-Optimal Parallel Prefetching and Caching

Cited in

(16)

• Integrated prefetching and caching in single and parallel disk systems
• Multi-stream \((Q,r)\) model and optimization for data prefetching
• Strongly competitive algorithms for caching with pipelined prefetching
• PBC: Prefetched Blocks Compaction
• scientific article; zbMATH DE number 1003271 (Why is no real title available?)
• A data prefetching algorithm for RAM grid
• Real-time integrated prefetching and caching
• Optimal Prediction for Prefetching in the Worst Case
• scientific article; zbMATH DE number 2080556 (Why is no real title available?)
• scientific article; zbMATH DE number 1753943 (Why is no real title available?)
• scientific article; zbMATH DE number 1756110 (Why is no real title available?)
• scientific article; zbMATH DE number 1875407 (Why is no real title available?)
• Optimal prepaging and font caching
• Optimal encoding of non-stationary sources
• On the equivalence of Occam algorithms
• A universal online caching algorithm based on pattern matching

This page was built for publication: Optimal prefetching via data compression

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