Scheduling I/O requests with deadlines: A performance evaluation
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 113-124
- https://doi.org/10.1109/real.1990.128736
Abstract
The I/O scheduling problem is examined in detail. The authors present a realistic model for studying this problem in the context of a system which executes real-time transactions. The model takes advantage of the fact that reading from the disk occurs before a transaction commits, while writing to the disk usually occurs after the transaction commits. New algorithms are presented that exploit this fact in order to meet the deadlines of individual requests. The algorithms are evaluated via detailed simulation and their performance is compared with traditional disk scheduling algorithms.Keywords
This publication has 7 references indexed in Scilit:
- Arm scheduling in shadowed disksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A protocol for timed atomic commitmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A continuum of disk scheduling algorithmsACM Transactions on Computer Systems, 1987
- On the Expected Performance of Scanning DisksSIAM Journal on Computing, 1982
- An anomaly in disk schedulingCommunications of the ACM, 1976
- Analysis of Scanning Policies for Reducing Disk Seek TimesSIAM Journal on Computing, 1972
- A comparative analysis of disk scheduling policiesCommunications of the ACM, 1972