skip to main content
research-article

Request Bridging and Interleaving: Improving the Performance of Small Synchronous Updates under Seek-Optimizing Disk Subsystems

Published:01 July 2011Publication History
Skip Abstract Section

Abstract

Write-through caching in modern disk drives enables the protection of data in the event of power failures as well as from certain disk errors when the write-back cache does not. Host system can achieve these benefits at the price of significant performance degradation, especially for small disk writes. We present new block-level techniques to address the performance problem of write-through caching disks. Our techniques are strongly motivated by some interesting results when the disk-level caching is turned off. By extending the conventional request merging, request bridging increases the request size and amortizes the inherent delays in the disk drive across more bytes of data. Like sector interleaving, request interleaving rearranges requests to prevent the disk head from missing the target sector position in close proximity, and thus reduces disk latency. We have evaluated our block-level approach using a variety of I/O workloads and shown that it increases disk I/O throughput by up to about 50%. For some real-world workloads, the disk performance is comparable or even superior to that of using the write-back disk cache. In practice, our simple yet effective solutions achieve better tradeoffs between data reliability and disk performance when applied to write-through caching disks.

References

  1. Bairavasundaram, L. N., Goodson, G. R., Pasupathy, S., and Schindler, J. 2007. An analysis of latent sector errors in disk drives. ACM SIGMETRICS Perform. Eval. Rev. 289--300. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Brunelle, A. D. 2009. blktrace User Guide. http://pdfedit.petricek.net/bt/.Google ScholarGoogle Scholar
  3. Dees, B. 2005. Native command queuing - advanced performance in desktop storage. Potentials, IEE 24, 4, 4--7.Google ScholarGoogle ScholarCross RefCross Ref
  4. Dell. 2004. Controllers: Dell Openmanage Storage Management User’s Guide. http://support.dell.com/support/edocs/software/svradmin/1.9/en/stormgmt/cntrls.html.Google ScholarGoogle Scholar
  5. Dimitrijevic, Z., Rangaswami, R., Watson, D., and Acharya, A. 2001. Diskbench: User-level disk feature extraction tool. Tech. rep. University of California Santa Barbara.Google ScholarGoogle Scholar
  6. Ding, X., Jiang, S., Chen, F., Davis, K., and Zhang, X. 2007. Diskseen: Exploiting disk layout and access history to enhance I/O prefetch. In Proceedings of the USENIX Annual Technical Conference. USENIX Association, Berkeley, CA, 261--274. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Ganger, G. R. 2001. Blurring the line between OSES and storage devices. Tech. rep. CMU-CS-01-166, Carnegie Mellon University, Pittsburgh, PA.Google ScholarGoogle Scholar
  8. Gill, B. S. and Modha, D. S. 2005. Wow: Wise ordering for writes -- Combining spatial and temporal locality in non-volatile caches. In Proceedings of the USENIX Conference on File and Storage Technologies. USENIX Association, Berkeley, CA, 129--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Guest, J. E., King, R. W., and Kiscaden, R. C. 1974. Locial sector interleave. IBM Tech. Disclosure Bull. 17, 05, 1460--1463.Google ScholarGoogle Scholar
  10. HP. 2002. Hp a5856a Raid 4si pci 4-Channel Ultra2 scsi Controller -- Installation and Administration Guide. http://docs.hp.com/en/J6173-90007/go01.html.Google ScholarGoogle Scholar
  11. Huang, L. and Chiueh, T. C. 2000. Implementation of a rotation-latency-sensitive disk scheduler. Tech. rep.Google ScholarGoogle Scholar
  12. IBM. 2004. Raid hard drive write-cache defaults to write-through mode -- Servers. http://www-947.ibm.com/support/entry/portal/docdisplay?lndocid=MIGR-44238.Google ScholarGoogle Scholar
  13. Iyer, S. and Druschel, P. 2001. Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O. In Proceedings of the ACM Symposium on Operating Systems Principles. ACM, New York, 117--130. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Jacobson, D. and Wilkes, J. 1991. Disk scheduling algorithms based on rotational position. Tech. rep. HPL-CSP-91-7rev1, HP Laboratories.Google ScholarGoogle Scholar
  15. Jiang, S., Ding, X., Chen, F., Tan, E., and Zhang, X. 2005. An effective buffer cache management scheme to exploit both temporal and spatial locality. In Proceedings of the 4th USENIX Conference on File and Storage Technologies. USENIX Association, Berkeley, CA, 101--114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Katcher, J. 1991. Postmark: A new file system benchmark. Tech. rep. HPL-CSP-91-7rev1, HP Laboratories.Google ScholarGoogle Scholar
  17. Kim, Y.-J., Lee, S.-J., Jang, K., and Kim, J. 2007. I/O performance optimization techniques for hybrid hard disk-based mobile consumer devices. IEEE Trans. Consumer Electron. 53, 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Li, C., Shen, K., and Papathanasiou, A. E. 2007. Competitive prefetching for concurrent sequential I/O. In Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Lumb, C. R., Schindler, J., and Ganger, G. R. 2002. Freeblock scheduling outside of disk firmware. In Proceedings of the Conference on File and Storage Technologies. 275--288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. McDougall, R. 2004. A new methodology for characterizing file system performance using a hybrid of analytic models and a synthetic benchmark. In Work in Progress Session in 3rd USENIX Conference on File and Storage Technologies. USENIX Association, Berkeley, CA.Google ScholarGoogle Scholar
  21. McKusick, M. K. and Ganger, G. R. 1999. Soft updates: A technique for eliminating most synchronous writes in the fast filesystem. In Proceedings of the Annual Technical Conference on USENIX Annual Technical Conference. USENIX Association, Berkeley, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. McKusick, M. K., Joy, W. N., Leffler, S. J., and Fabry, R. S. 1984. A fast file system for UNIX. ACM Trans. Comput. Syst. 22, 3, 181--197. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Piggin, N. 2003. Anticipatory I/O scheduler. Linux Kernel version 2.6.24 documentation.Google ScholarGoogle Scholar
  24. Prabhakaran, V., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2005. Analysis and evolution of journaling file systems. In Proceedings of the USENIX Annual Technical Conference. USENIX Association, Berkeley, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Reuther, L. and Pohlack, M. 2003. Rotational-position-aware real-time disk scheduling using a dynamic active subset (DAS). In Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS). IEEE, Los Alamitos, CA, 374. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Riska, A., Larkby-Lahet, J., and Riedel, E. 2007. Evaluating block-level optimization through the IO path. In Proceedings of the USENIX Annual Technical Conference. USENIX Association, 247--260. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Rosenblum, M. and Ousterhout, J. K. 1992. The design and implementation of a log-structured file system. ACM Trans. Comput. Syst. 10, 1--15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Ruemmler, C. and Wilkes, J. 1992. Unix disk access patterns. HPL-92-152.Google ScholarGoogle Scholar
  29. Ruemmler, C. and Wilkes, J. 1994. An introduction to disk drive modeling. Computer 27, 3, 17--28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Schindler, J. and Ganger, G. R. 2000. Automated disk drive characterization. In Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Schindler, J., Griffin, J. L., Lumb, C. R., and Ganger, G. R. 2002. Track-aligned extents: Matching access patterns to disk drive characteristics. In Proceedings of the USENIX Conference on File and Storage Technologies. USENIX Association, Berkeley, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Seltzer, M., Chen, P., and Ousterhout, J. 1993. Disk scheduling revisited. In Proceedings of the Winter USENIX Conference. USENIX Association, Berkeley, CA, 405--420.Google ScholarGoogle Scholar
  33. Seltzer, M. I., Ganger, G. R., McKusick, M. K., Simith, K. A., Soules, C. A. N., and Stein, C. A. 2000. Journaling versus soft updates: Asynchronous meta-data protection in file systems. In Proceedings of the USENIX Annual Technical Conference. USENIX Association, Berkeley, CA, 71--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Shanley, T. and Anderson, D. 1999. PCI System Architecture 4th Ed. Addison-Wesley, Reading, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Shin, D. I., Yu, Y. J., and Yeom, H. Y. 2007. Shedding light in the black-box: Structural modeling of modern disk drives. In Proceedings of the 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. IEEE, Los Alamitos, CA, 410--417. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Sivathanu, M., Prabhakaran, V., Popovici, F. I., Denehy, T. E., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2003. Semantically-smart disk systems. In Proceedings of the Conference on File and Storage Technologies. USENIX Association, Berkeley, CA, 73--88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Sivathanu, M., Bairayasundaram, L. N., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. 2004. An analysis of latent sector errors in disk drives. ACM SIGMETRICS Perform. Eval. Rev. 374--394. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. T13. 2004. At attachment with packet interface -- 7 vols: 1. Working Draft American National Standard Revision 4b.Google ScholarGoogle Scholar
  39. Weber, R. O. 2004. SCSI architecture model-3 (sam-3).Google ScholarGoogle Scholar
  40. Won, Y., Chang, H., and Ryu, J. 2006. Intelligent storage: Cross-layer optimization for soft real-time workload. ACM Trans. Storage 2, 3, 255--282. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. Worthington, B. L., Ganger, G. R., and Patt, Y. N. 1994. Scheduling algorithms for modern disk drives. In Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems. ACM, New York, 241--251. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Worthington, B. L., Ganger, G. R., Patt, Y. N., and Wilkes, J. 1995. On-line extraction of SCSI disk drive parameters. In Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems. ACM, New York, 146--156. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Request Bridging and Interleaving: Improving the Performance of Small Synchronous Updates under Seek-Optimizing Disk Subsystems

                      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

                      Full Access

                      • Published in

                        cover image ACM Transactions on Storage
                        ACM Transactions on Storage  Volume 7, Issue 2
                        July 2011
                        133 pages
                        ISSN:1553-3077
                        EISSN:1553-3093
                        DOI:10.1145/1970348
                        Issue’s Table of Contents

                        Copyright © 2011 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 July 2011
                        • Accepted: 1 January 2011
                        • Revised: 1 June 2010
                        • Received: 1 January 2010
                        Published in tos Volume 7, Issue 2

                        Permissions

                        Request permissions about this article.

                        Request Permissions

                        Check for updates

                        Qualifiers

                        • research-article
                        • Research
                        • Refereed

                      PDF Format

                      View or Download as a PDF file.

                      PDF

                      eReader

                      View online with eReader.

                      eReader