Tight bounds for prefetching and buffer management algorithms for parallel I/O systems

DOI10.1007/3-540-62034-6_50MaRDI QIDQ6567769zbMATH OpenFDO

Authors Peter J. Varman, Rakesh M. Verma

Publication date 5 July 2024

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• Competitive Parallel Disk Prefetching and Buffer Management
• scientific article; zbMATH DE number 1419218
• Near-Optimal Parallel Prefetching and Caching
• Analysis of simple randomized buffer management for parallel I/O
• Optimal read-once parallel disk scheduling

Cites work

• A new measure for the study of on-line algorithms
• Competitive paging algorithms
• Markov analysis of multiple-disk prefetching strategies for external merging
• On competitive on-line paging with lookahead

This page was built for publication: Tight bounds for prefetching and buffer management algorithms for parallel I/O systems

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