A disk scheduling algorithm: SPFF

DOI10.1007/BF02832452MaRDI QIDQ3378861zbMATH OpenFDO

Authors Ming Hu

Publication date 4 April 2006

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02832452

zbMATH Keywords

scheduling polices

Mathematics Subject Classification ID

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

Recommendations

• New algorithms for disk scheduling
• scientific article; zbMATH DE number 885350
• Optimal read-once parallel disk scheduling
• Competitive analysis of on-line disk scheduling
• Competitive analysis of on-line disk scheduling

Cited in

(5)

• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• SPFF
• Improved disk scheduling algorithms based on rotational position
• Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues
• New algorithms for disk scheduling

This page was built for publication: A disk scheduling algorithm: SPFF

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