A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy

DOI10.1016/0020-0190(95)00055-HMaRDI QIDQ672979zbMATH OpenFDO

Authors Yen-Jen Oyang

Publication date 28 February 1997

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

zbMATH Keywords

ModelingReal-time systemsDisk schedulingInformation retrieval

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 885350
• New algorithms for disk scheduling
• A hierarchical disk scheduler for multimedia systems

Cites work

• A comparative analysis of disk scheduling policies
• Analysis of Scanning Policies for Reducing Disk Seek Times

Cited in

(1)

• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN

This page was built for publication: A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy

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