Duality Between Prefetching and Queued Writing with Parallel Disks

DOI10.1137/S0097539703431573MaRDI QIDQ5317205zbMATH OpenOpenAlexFDO

Authors David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter

Publication date 16 September 2005

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539703431573

zbMATH Keywords

cachingexternal memory sortingload balancinglower boundprefetchingrandomized algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1877045
• Near-Optimal Parallel Prefetching and Caching
• Integrated prefetching and caching in single and parallel disk systems
• scientific article; zbMATH DE number 1419218
• Competitive Parallel Disk Prefetching and Buffer Management

Cited in

(8)

• Markov analysis of multiple-disk prefetching strategies for external merging
• Integrated prefetching and caching in single and parallel disk systems
• Real-time integrated prefetching and caching
• Adaptive control of pre-fetching
• scientific article; zbMATH DE number 1848286 (Why is no real title available?)
• scientific article; zbMATH DE number 1877045 (Why is no real title available?)
• STACS 2004
• Minimizing stall time in single and parallel disk systems

This page was built for publication: Duality Between Prefetching and Queued Writing with Parallel Disks

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