首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >I/O Stack Optimization for Efficient and Scalable Access in FCoE-Based SAN Storage
【24h】

I/O Stack Optimization for Efficient and Scalable Access in FCoE-Based SAN Storage

机译:针对基于FCoE的SAN存储中的高效可扩展访问的I / O堆栈优化

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

摘要

Due to the high complexity in software hierarchy and the shared queue & lock mechanism for synchronized access, existing I/O stack for accessing the FCoE based SAN storage becomes a performance bottleneck, thus leading to a high I/O overhead and limited scalability in multi-core servers. In order to address this performance bottleneck, we propose a synergetic and efficient solution that consists of three optimization strategies for accessing the FCoE based SAN storage: (1) We use private per-CPU structures and disabling kernel preemption method to process I/Os, which significantly improves the performance of parallel I/O in multi-core servers; (2) We directly map the requests from the block-layer to the FCoE frames, which efficiently translates I/O requests into network messages; (3) We adopt a low latency I/O completion scheme, which substantially reduces the I/O completion latency. We have implemented a prototype (called FastFCoE, a protocol stack for accessing the FCoE based SAN storage). Experimental results demonstrate that FastFCoE achieves efficient and scalable I/O throughput, obtaining 1132.1K/836K IOPS (6.6/5.4 times as much as original Linux Open-FCoE stack) for read/write requests.
机译:由于软件层次结构的高度复杂性以及用于同步访问的共享队列和锁定机制,用于访问基于FCoE的SAN存储的现有I / O堆栈成为性能瓶颈,因此导致高的I / O开销和多扩展中有限的可伸缩性-核心服务器。为了解决此性能瓶颈,我们提出了一种协同高效的解决方案,该方案包含三种优化策略,用于访问基于FCoE的SAN存储:(1)我们使用专用的每CPU结构并禁用内核抢占方法来处理I / O,大大提高了多核服务器中并行I / O的性能; (2)我们直接将请求从块层映射到FCoE帧,从而有效地将I / O请求转换为网络消息; (3)我们采用了低延迟的I / O完成方案,这大大减少了I / O完成延迟。我们已经实现了一个原型(称为FastFCoE,用于访问基于FCoE的SAN存储的协议栈)。实验结果表明,FastFCoE可实现高效且可扩展的I / O吞吐量,可为读取/写入请求获得1132.1K / 836K IOPS(是原始Linux Open-FCoE堆栈的6.6 / 5.4倍)。

著录项

  • 来源
  • 作者单位

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

    Ministry of Education of China, Wuhan National Lab for Optoelectronics, Key Laboratory of Data Storage Systems (School of Computer Science and Technology, Huazhong University of Science and Technology), Wuhan, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Servers; Scalability; Throughput; Synchronization; Multicore processing; Optimization; Protocols;

    机译:服务器;可伸缩性;吞吐量;同步;多核处理;优化;协议;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号