Analysis of simple randomized buffer management for parallel I/O

DOI10.1016/J.IPL.2004.01.009zbMATH Open1177.68044OpenAlexW2107246495MaRDI QIDQ2390215FDOQ2390215

Peter J. Varman, Mahesh Kallahalla

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

Recommendations

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

zbMATH Keywords

randomizationanalysis of algorithmsbuffer managementcompetitive ratiocachingprefetchingparallel I/O

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Competitive paging algorithms
• A strongly competitive randomized paging algorithm
• Random duplicate storage strategies for load balancing in multimedia servers
• On the influence of lookahead in competitive paging algorithms
• Near-Optimal Parallel Prefetching and Caching
• Algorithms for parallel memory, I: Two-level memories
• Simple randomized mergesort on parallel disks
• Title not available (Why is that?)
• Competitive Parallel Disk Prefetching and Buffer Management
• Title not available (Why is that?)
• On competitive on-line paging with lookahead
• Title not available (Why is that?)

Cited In (4)

• Management of partially safe buffers
• Title not available (Why is that?)
• DIG: Degree of inter-reference gap for a dynamic buffer cache management
• THE SHUFFLING BUFFER

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)