skip to main content
10.1145/183018.183045acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
Article
Free Access

Scheduling algorithms for modern disk drives

Authors Info & Claims
Published:01 May 1994Publication History

ABSTRACT

Disk subsystem performance can be dramatically improved by dynamically ordering, or scheduling, pending requests. Via strongly validated simulation, we examine the impact of complex logical-to-physical mappings and large prefetching caches on scheduling effectiveness. Using both synthetic workloads and traces captured from six different user environments, we arrive at three main conclusions: (1) Incorporating complex mapping information into the scheduler provides only a marginal (less than 2%) decrease in response times for seek-reducing algorithms. (2) Algorithms which effectively utilize prefetching disk caches provide significant performance improvements for workloads with read sequentiality. The cyclical scan algorithm (C-LOOK), which always schedules requests in ascending logical order, achieves the highest performance among seek-reducing algorithms for such workloads. (3) Algorithms that reduce overall positioning delays produce the highest performance provided that they recognize and exploit a prefetching cache.

References

  1. Denn67.P. J. Denning, "Effects of schedtfling on file memory operations", AFIPS Spriug Joint Computer Conference, April 1967, pp. 9-21.Google ScholarGoogle Scholar
  2. Gang93.G. Ganger, Y. Part, "The Process-Flow Model: Examining I/O Performance from the System's Point of View", SIGMETRICS, 1993, pp. 86-97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Geis87.R. Geist, S. Daniel, "A Continuum of Disk Scheduling Algorithms", A CM Transactions on Computer Systems, February 1987, pp. 77-92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. HP92.Hewlett-Pack~d Company, "HP C2240 Series 3.5-inch SCSI-2 Disk Drive, Technical Reference Manual", Part Number 5960-8346, Edition 2, April 1992.Google ScholarGoogle Scholar
  5. Jaco91.D. Jacobson, J. Wilkes, "Disk Scheduling Algorithms Based on Rotational Position", Hewlett-Packard Technical Report, HPL-CSP-91-7, Feb. 26, 1991.Google ScholarGoogle Scholar
  6. McNu86.B. McNutt, "An Empirical Study of Variations in DASD Volume Activity", CMG, 1986, pp. 274-283.Google ScholarGoogle Scholar
  7. Mert70.A. G. Merten, "Some quantitative techniques for file organization", Ph.D. Thesis, Technical Report No. 15, U. of Wisconsin Comput. Center, 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Rama92.K. Ramakrishnan, P. Biswas, R. Karedla, "Analysis of File I/O Traces in Commercial Computing Environments", A CM S{GMETR{CS, 1992, pp. 78-90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ruem93.C. Ruemmler, J. Wilkes, "UNIX Disk Access Patterns", Winter USENIX, 1993.Google ScholarGoogle Scholar
  10. Ruem94.C. Ruemmler, J. Wilkes, "Modelling Disks", IEEE Co mput e r, March 1994.Google ScholarGoogle Scholar
  11. Seam66.P. H. Seaman, R. A. Lind, T. L. Wilson "An analysis of auxillary-storage activity", IBM System Journal, Voi. 5, No. 3, 1966, pp. 158-170.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Selt90.M. Seltzer, P. Chen, J. Ousterhout, "Disk Scheduling Revisited", Wiuter USENIX, 1990, pp. 313-324.Google ScholarGoogle Scholar
  13. Teor72.T. Teorey, T. Pinkerton, "A Comparative Analysis of Disk Scheduling Policies", Communications of the A C21I, March 1972, pp. 177-184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wort94.B. Worthington, G. Ganger, Y. Putt, "Scheduling for Modern Disk Drives and Non-Random Worldoads", U. of Michigan, Technical Report CSE-TR-194-94, 1994.Google ScholarGoogle Scholar

Index Terms

  1. Scheduling algorithms for modern disk drives

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SIGMETRICS '94: Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
            May 1994
            294 pages
            ISBN:089791659X
            DOI:10.1145/183018

            Copyright © 1994 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 May 1994

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate459of2,691submissions,17%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader