New algorithms for disk scheduling

Algorithmica (New York)

Volumn 32, Issue 2, 2002, Pages 277-301

  Andrews, M ^a   Bender, M A ^b   Zhang, L ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b Stony Brook University   (United States)

Author keywords

Approximation algorithms; Asymmetric Traveling salesman Problem; Disk scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; TRAVELING SALESMAN PROBLEM;

DISK SCHEDULING;

SCHEDULING;

EID: 0141888207     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0071-1     Document Type: Article

References (24)

1. M. Baker, S. Asami, E. Deprit, J. Ousterhout, and M. Seltzer. Non-volatile memory for fast, reliable file systems. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems,pages 10-22, October 1992.
2. K. Bogart. Introductory Combinatorics. Harcourt Brace Jovanovich, Orlando, Florida, 1990.
3. E. G. Coffman, L. A. Klimko, and B. Ryan. Analysis of scanning policies for reducing disk seek times. SIAM Journal of Computing, 1 (3):269-279, September 1972.
4. R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51(2): 161-166, 1950.
5. A. M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12:23-39, 1982.
6. G. Gallo, F. Malucelli, and M. Marrè. Hamiltonian paths algorithms for disk scheduling. Technical Report 20/94, Dipartimento di Informatica, Università di Pisa, 1994.
7. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
8. R. Geist and S. Daniel. A continuum of disk scheduling algorithms. ACM Transactions on Computer Systems, 5(1):77-92, February 1987.
9. C. C. Gotlieb and H. MacEwen. Performance of movable-head disk storage devices. Journal of the ACM, 20(4):604-625, October 1973.
10. D. Hitz, J. Lau, and M. Malcolm. File system design for an NFS file server appliance. In USENIX,pages 235-245, Winter 1994.
11. M. Hofri. Disk scheduling: FCFS vs SSTF revisited. Communications of the ACM, 23(11):645-653, November 1980.
12. D. M. Jacobson and J. Wilkes. Disk scheduling algorithms based on rotational position. Technical Report HPL-CSP-91-7rev1, Hewlett-Packard Company, 1991.
13. D. Kotz, S. B. Toh, and S. Radhakrishnan. A detailed simulation model of the HP 97560 disk drive. Technical Report PCS-TR94-220, Dartmouth College, 1994.
14. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83-97,1955.
15. W. C. Oney. Queuing analysis of the scan policy for moving-head disks. Journal of the ACM, 22 (3):397-412, July 1975.
16. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
17. J. Plesnik. The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Unpublished manuscript, 1978.
18. C. Ruemmler and J. Wilkes. UNIX disk access patterns. In USENIX,pages 405-420, Winter 1993.
19. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17-29, March 1994.
20. M. Seltzer, P. Chen, and J. Ousterhout. Disk scheduling revisited. In USENIX,pages 313-324, Winter 1990.
21. T. J. Teorey and T. B. Pinkerton. A comparative analysis of disk scheduling policies. Communications of the ACM, 15(3):177-184, March 1972.
22. N. C. Wilhelm. An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses. Communications of the ACM, 9(1): 13-17, January 1976.
23. B. L. Worthington, G. R. Ganger, and Y. N. Patt. Scheduling algorithms for modern disk drives. In SIGMETRICS,pages 241-251, 1994.
24. B. L. Worthington, G. R. Ganger, Y. N. Patt, and J. Wilkes. On-line extraction of SCSI disk drive parameters. In SIGMETRICS,pages 146-156, 1995.