Duality Between Prefetching and Queued Writing with Parallel Disks

DOI10.1137/S0097539703431573zbMath1081.68119OpenAlexW2618200412MaRDI QIDQ5317205

Peter Sanders, David A. Hutchinson, 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

randomized algorithmlower boundprefetchingload balancingcachingexternal memory sorting

Mathematics Subject Classification ID

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

Related Items

Real-time integrated prefetching and caching