Optimal read-once parallel disk scheduling
From MaRDI portal
Publication:818672
DOI10.1007/S00453-004-1129-7zbMATH Open1086.68023OpenAlexW2053035562MaRDI QIDQ818672FDOQ818672
Authors: Mahesh Kallahalla, Peter J. Varman 
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-004-1129-7
Recommendations
- scientific article; zbMATH DE number 1206104
- scientific article; zbMATH DE number 1300386
- Competitive Parallel Disk Prefetching and Buffer Management
- Optimal Scheduling of Tasks on Identical Parallel Processors
- scientific article; zbMATH DE number 1003299
- Selection algorithms for parallel disk systems
- New algorithms for disk scheduling
- Optimal batch schedules for parallel machines
Cited In (10)
- Title not available (Why is that?)
- Real-time integrated prefetching and caching
- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
- Title not available (Why is that?)
- New algorithms for disk scheduling
- A disk scheduling algorithm: SPFF
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Optimal multi-file read policies for optical discs
- Analysis of simple randomized buffer management for parallel I/O
- Competitive analysis of on-line disk scheduling
This page was built for publication: Optimal read-once parallel disk scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818672)
