首页> 外文期刊>ACM transactions on computer systems >Optimizing the Block I/O Subsystem for Fast Storage Devices
【24h】

Optimizing the Block I/O Subsystem for Fast Storage Devices

机译:优化快速存储设备的块I / O子系统

获取原文
获取原文并翻译 | 示例

摘要

Fast storage devices are an emerging solution to satisfy data-intensive applications. They provide high transaction rates for DBMS, low response times for Web servers, instant on-demand paging for applications with large memory footprints, and many similar advantages for performance-hungry applications. In spite of the benefits promised by fast hardware, modern operating systems are not yet structured to take advantage of the hardware's full potential. The software overhead caused by an OS, negligible in the past, adversely impacts application performance, lessening the advantage of using such hardware. Our analysis demonstrates that the overheads from the traditional storage-stack design are significant and cannot easily be overcome without modifying the hardware interface and adding new capabilities to the operating system. In this article, we propose six optimizations that enable an OS to fully exploit the performance characteristics of fast storage devices. With the support of new hardware interfaces, our optimizations minimize per-request latency by streamlining the I/O path and amortize per-request latency by maximizing parallelism inside the device. We demonstrate the impact on application performance through well-known storage benchmarks run against a Linux kernel with a customized SSD. We find that eliminating context switches in the I/O path decreases the software overhead of an I/O request from 20 microseconds to 5 microseconds and a new request merge scheme called Temporal Merge enables the OS to achieve 87% to 100% of peak device performance, regardless of request access patterns or types. Although the performance improvement by these optimizations on a standard SATA-based SSD is marginal (because of its limited interface and relatively high response times), our sensitivity analysis suggests that future SSDs with lower response times will benefit from these changes. The effectiveness of our optimizations encourages discussion between the OS community and storage vendors about future device interfaces for fast storage devices.
机译:快速存储设备是满足数据密集型应用程序的新兴解决方案。它们为DBMS提供高事务处理率,为Web服务器提供低响应时间,为具有大内存占用空间的应用程序提供即时按需分页功能,以及对性能要求高的应用程序具有许多类似的优点。尽管快速硬件带来了许多好处,但现代操作系统尚未构建成能够充分利用硬件的全部潜力。过去可忽略的由OS引起的软件开销会对应用程序性能产生不利影响,从而降低了使用此类硬件的优势。我们的分析表明,传统存储堆栈设计带来的开销是巨大的,如果不修改硬件接口并向操作系统添加新功能就无法轻松克服。在本文中,我们提出了六个优化方案,使操作系统能够充分利用快速存储设备的性能特征。在新硬件接口的支持下,我们的优化通过简化I / O路径来最大程度地减少每请求延迟,并通过最大化设备内部的并行度来摊销每请求延迟。我们通过针对具有定制SSD的Linux内核运行的著名存储基准测试,演示了对应用程序性能的影响。我们发现,消除I / O路径中的上下文切换可以将I / O请求的软件开销从20微秒减少到5微秒,并且一种称为“临时合并”的新请求合并方案使OS可以达到峰值设备的87%到100%性能,无论请求访问模式或类型如何。尽管通过基于SATA的标准SSD进行的这些优化所带来的性能提升是微不足道的(由于其接口有限且响应时间相对较长),但我们的敏感性分析表明,未来响应时间较短的SSD将受益于这些变化。我们优化的有效性鼓励OS社区与存储供应商之间就快速存储设备的未来设备接口进行讨论。

著录项

  • 来源
    《ACM transactions on computer systems》 |2014年第2期|6.1-6.48|共48页
  • 作者单位

    Seoul National University,Infrastructure Development and Operations group, AOL Inc., Dulles, VA;

    Taejin Infotech, 37-bunji, Seobingo-dong, Yongsan-gu, Seoul, Republic of Korea;

    Department of Computer Science and Engineering, Seoul National University, Daehak-dong, Kwanak-gu, Seoul, Republic of Korea;

    Department of Computer Science and Engineering, Seoul National University, Daehak-dong, Kwanak-gu, Seoul, Republic of Korea;

    Taejin Infotech, 37-bunji, Seobingo-dong, Yongsan-gu, Seoul, Republic of Korea;

    Seoul National University,SAP Labs Korea, Inc., Seoul, Republic of Korea;

    Department of Computer Science and Engineering, Seoul National University, Daehak-dong, Kwanak-gu, Seoul, Republic of Korea;

    Department of Computer Science and Engineering, Seoul National University, Daehak-dong, Kwanak-gu, Seoul, Republic of Korea;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    I/O subsystem; device polling; request batching; extended interface;

    机译:I / O子系统;设备轮询;要求分批;扩展接口;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号