Optimal read-once parallel disk scheduling

DOI10.1007/S00453-004-1129-7MaRDI QIDQ818672zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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)

• Competitive analysis of on-line disk scheduling
• Real-time integrated prefetching and caching
• scientific article; zbMATH DE number 1424318 (Why is no real title available?)
• Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
• scientific article; zbMATH DE number 1775431 (Why is no real title available?)
• 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

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)