Strongly competitive algorithms for caching with pipelined prefetching

DOI10.1007/3-540-44676-1_4MaRDI QIDQ4796166zbMATH OpenFDO

Authors Alexander Gaysinsky, Alon Itai, Hadas Shachnai

Publication date 2 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2161/21610049

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Strongly competitive algorithms for caching with pipelined prefetching
• Near-Optimal Parallel Prefetching and Caching
• On-line file caching
• Optimal prefetching via data compression
• scientific article; zbMATH DE number 1303544

Cited in

(4)

• Integrated prefetching and caching in single and parallel disk systems
• Strongly competitive algorithms for caching with pipelined prefetching
• Enhanced prefetching and caching strategies for single- and multi-disk systems
• scientific article; zbMATH DE number 2080556 (Why is no real title available?)

This page was built for publication: Strongly competitive algorithms for caching with pipelined prefetching

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