Analysis of simple randomized buffer management for parallel I/O

DOI10.1016/J.IPL.2004.01.009MaRDI QIDQ2390215zbMATH OpenOpenAlexFDO

Authors Mahesh Kallahalla, Peter J. Varman

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1911/81638

zbMATH Keywords

analysis of algorithmsbuffer managementcachingcompetitive ratioparallel I/Oprefetchingrandomization

Mathematics Subject Classification ID

Theory of operating systems (68N25) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1419218
• Publication:4945532
• Competitive Parallel Disk Prefetching and Buffer Management
• scientific article; zbMATH DE number 1445386
• Optimal read-once parallel disk scheduling

Cites work

• A strongly competitive randomized paging algorithm
• Algorithms for parallel memory, I: Two-level memories
• Competitive paging algorithms
• Competitive Parallel Disk Prefetching and Buffer Management
• scientific article; zbMATH DE number 3548141 (Why is no real title available?)
• scientific article; zbMATH DE number 1775431 (Why is no real title available?)
• scientific article; zbMATH DE number 1419218 (Why is no real title available?)
• scientific article; zbMATH DE number 1445386 (Why is no real title available?)
• Near-Optimal Parallel Prefetching and Caching
• On competitive on-line paging with lookahead
• On the influence of lookahead in competitive paging algorithms
• Random duplicate storage strategies for load balancing in multimedia servers
• Simple randomized mergesort on parallel disks

Cited in

(6)

• DIG: Degree of inter-reference gap for a dynamic buffer cache management
• Management of partially safe buffers
• Competitive Parallel Disk Prefetching and Buffer Management
• THE SHUFFLING BUFFER
• scientific article; zbMATH DE number 1419218 (Why is no real title available?)
• Tight bounds for prefetching and buffer management algorithms for parallel I/O systems

This page was built for publication: Analysis of simple randomized buffer management for parallel I/O

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