skip to main content
10.1145/2245276.2232062acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

DADS: dynamic and automatic disk scheduling

Published:26 March 2012Publication History

ABSTRACT

The selection of the right I/O scheduler for a given workload can greatly improve the performance of a system. But, this is not an easy task because several factors should be considered, and even the scheduler deemed the "best" can change at any moment. So, we present a Dynamic and Automatic Disk Scheduling framework (DADS) that compares different Linux I/O schedulers and automatically and dynamically selects that which achieves the best performance for any workload. The implementation described here compares two schedulers by running two instances of a disk simulator inside the Linux kernel, each one having a different scheduler. Our proposal compares the schedulers' service times, and changes the scheduler in the real disk if the performance is expected to improve. DADS has been analyzed by using different workloads, hard disks, and schedulers. Results show that it selects the best scheduler of the two compared at each moment, improving the performance and exempting system administrators from selecting a suboptimal scheduler.

References

  1. G. Denys, F. Piessens, and F. Matthijs. A survey of customizability in operating systems research. ACM Comput. Surv., 34: 450--468, December 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. González-Férez, J. Piernas, and T. Cortés. Simultaneous evaluation of multiple I/O strategies. In Proceeding of the SBAC-PAD 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. K. Ousterhout. Why Aren't Operating Systems Getting Faster As Fast as Hardware? In USENIX Summer. USENIX Association, 1990.Google ScholarGoogle Scholar
  4. C. Ruemmler and J. Wilkes. An Introduction to Disk Drive Modeling. Computer, 27(3): 17--28, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Schindler and G. R. Ganger. Automated Disk Drive Characterization. Technical report, 12 1999.Google ScholarGoogle Scholar
  6. S. Seelam, J. S. Babu, and P. Teller. Automatic I/O Scheduler Selection for Latency and Bandwidth Optimization. In Proc. of the Workshop on Operating System Interface on High Per. Applications, 2005.Google ScholarGoogle Scholar
  7. M. Seltzer and C. Small. Self-Monitoring and Self-Adapting Operating Systems. In Proceedings of the 6th Workshop on Hot Topics in Operating Systems. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. E. Shriver. Performance modeling for realistic storage devices. PhD thesis, 5 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. L. Worthington, G. R. Ganger, Y. N. Patt, and J. Wilkes. On-Line Extraction of SCSI DISK Drive Parameters. Technical report, 1997.Google ScholarGoogle Scholar
  10. Y. Zhang and B. Bhargava. Self-learning disk scheduling. IEEE Trans. on Knowl. and Data Eng., 21: 50--65, January 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. DADS: dynamic and automatic disk scheduling

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
    SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
    March 2012
    2179 pages
    ISBN:9781450308571
    DOI:10.1145/2245276
    • Conference Chairs:
    • Sascha Ossowski,
    • Paola Lecca

    Copyright © 2012 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: 26 March 2012

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader