Batched disk scheduling with delays
Pages 36 - 41
Abstract
One of the important performance enhancing capabilities of modern disk drives, is the ability to permute the order of service of incoming I/O requests in order to minimize total access time. Given a batch (set) of I/O requests, the problem of finding the optimal order of service is known as the Batched Disk Scheduling Problem (BDSP). BDSP is a well known instance of the Asymmetric Traveling Salesman Problem (ATSP), in fact it has been used as one of a few principal test cases for the examination of heuristic algorithms for the ATSP, [4], [12]. To specify an instance of BDSP amounts to a choice of a model for the mechanical motion of the disk and a choice of locations and lengths of the requested I/O in the batch. The distance between requests is the amount of time needed by the disk to move from the end of one request to the beginning of the other, thus the amount of time needed to read the data itself, Transfer time, is not counted since it is independent of the order of the requests, only the order dependent Access time is computed.
References
[1]
M. Andrews, M. A. Bender, and L. Zhang, New Algorithms for the Disk Scheduling Problem, Algorithmica, 32(2), 277--301, 2002.]]
[2]
E. Bachmat, Average case analysis for batched disk scheduling and increasing subsequences, Proceedings of the Symposium on Theory Of Computing (STOC), Montreal, 2002.]]
[3]
E. Bachmat, Analysis of disk scheduling with linear seek functions, increasing subsequences and space-time geometry, Submitted, 2005. Available at www.cs.bgu.ac.il/ebachmat.]]
[4]
J. Cirasella, D. S. Johnson, L. A. McGeoch, and W. Zhang, The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests, ALENEX 2001 Proceedings, Springer Lecture Notes in Computer Science 2153, A. L. Buchsbaum and J. Snoeyink (eds.), 32--59.]]
[5]
E.G. Coffman, L.A. Klimko and B.Ryan, Analysis of scanning policies for reducing disk seek times, SIAM Journal of computing, 1(3), 1972.]]
[6]
G. Gallo, F. Malucelli and M. Marre, Hamiltonian paths algorithms for disk scheduling, Universita of Pisa technical report, 20/94, 1994.]]
[7]
W. Gangbo and R. McCann, The geometry of optimal transportation, Acta Math. 177, 1996, 113--161.]]
[8]
C.C. Gotlieb and H.McEwan, Performance of a movable-head disk storage device, Journal of the ACM, 20(4):604--623, 1973.]]
[9]
W. Hoeffding. Probability inequalities for sums of bounded random variables, Journal of the American Statistical Assosiation, 301, 1963, 13--30.]]
[10]
M. Hofri, Disk scheduling: FCFS vs SSTF revisited. Communications of the ACM, 23(11), 1980.]]
[11]
D. Jacobson and J. Wilkes, Disk scheduling algorithms based on rotational position, HP labs technical report, HPL-CSP-91-7rev1, 1991.]]
[12]
D. S. Johnson, G. Gutin, L. A. McGeoch, A. Yeo, W. Zhang, and A. Zverovich, Experimental Analysis of Heuristics for the ATSP, The Traveling Salesman Problem and its Variations, G. Gutin and A. Punnen, Editors, Kluwer Academic Publishers, Dordrecht, 2002, 445--487.]]
[13]
R. McCann, Exact solutions to the transportation problem on the line, Proc. Royal Soc. London Ser. A, 455, 1999, 1341--1380.]]
[14]
A. Riska, E. Riedel and S. Iren, Managing Overload Via Adaptive Scheduling, in Proceedings of the 1st Workshop on Algorithms and Architecture for Self-Managing Systems, pages 23-24, San-Diego, CA, June 2003.]]
[15]
Alma Riska, Erik Riedel and Sami Iren, Adaptive disk scheduling for overload management, in Proceedings of the 1st International Conference on Quantitative Evaluation of Systems, (QEST), pages 176--186, The Netherlands, September, 2004.]]
[16]
P. Sanders and B. Vcking, Tail bounds and expectations for random arc allocation and applications, Combinatorics Probability and Computing, 12(3), 2003, 301--318.]]
[17]
M. Seltzer, Chen P. and J. Ousterhout, Disk scheduling revisited, Proceedings of the Usenix technical conference, 313--324, winter 1990.]]
Index Terms
- Batched disk scheduling with delays
Recommendations
Mirrored disk rouing and scheduling
Disk mirroring or RAID level 1 stores the same data twice, on two independent disks, to ensure that all single disk failures can be tolerated. This high storage overhead is acceptable in view of the drop in storage cost per gigabyte and rapidly ...
DCD—disk caching disk: a new approach for boosting I/O performance
ISCA '96: Proceedings of the 23rd annual international symposium on Computer architectureThis paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose of optimizing I/O performance. The main idea of the DCD is to use a small log disk, referred to as cache-disk, as a secondary disk cache to optimize ...
Systems Support for Preemptive Disk Scheduling
Allowing higher-priority requests to preempt ongoing disk IOs is of particular benefit to delay-sensitive and real-time systems. In this paper, we present Semi-preemptible IO, which divides disk IO requests into small temporal units of disk commands to ...
Comments
Information & Contributors
Information
Published In
Copyright © 2006 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 2006
Published in SIGMETRICS Volume 33, Issue 4
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 162Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in