Affiliation:
1. Univ. of Wisconsin, Madison
Abstract
Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented). Both analytical and simulation results are obtained. The variance of waiting time is introduced as another meaningful measure of performance, showing possible discrimination against individual requests. Then the choice of a utility function to measure total performance including system oriented and individual request oriented measures is described. Such a function allows one to differentiate among the scheduling policies over a wide range of input loading conditions. The selection and implementation of a maximum performance two-policy algorithm are discussed.
Publisher
Association for Computing Machinery (ACM)
Cited by
114 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Do we still need IO schedulers for low-latency disks?;Proceedings of the 15th ACM Workshop on Hot Topics in Storage and File Systems;2023-07-09
2. Bibliography;Storage Systems;2022
3. Disk drive data placement and scheduling;Storage Systems;2022
4. Multimedia Resource Scheduling;Encyclopedia of Database Systems;2018
5. Disk scheduling with shortest cumulative access time first algorithms;TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES;2017