...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Frontiers of computer science >WOBTree: a write-optimized B+-tree for non-volatile memory
【24h】

WOBTree: a write-optimized B+-tree for non-volatile memory

机译：Wobtree：非易失性存储器的写优化B + -tree

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The emergence of non-volatile memory (NVM) has introduced new opportunities for performance optimizations in existing storage systems. To better utilize its byte-addressability and near-DRAM performance, NVM can be attached on the memory bus and accessed via load/store memory instructions rather than the conventional block interface. In this scenario, a cache line (usually 64 bytes) becomes the data transfer unit between volatile and non-volatile devices. However, the failure-atomicity of write on NVM is the memory bit width (usually 8 bytes). This mismatch between the data transfer unit and the atomicity unit may introduce write amplification and compromise data consistency of node-based data structures such as B+-trees. In this paper, we propose WOBTree, a Write-Optimized B+-Tree for NVM to address the mismatch problem without expensive logging. WOBTree minimizes the update granularity from a tree node to a much smaller subnode and carefully arranges the write operations in it to ensure crash consistency and reduce write amplification. Experimental results show that compared with previous persistent B+-tree solutions, WOBTree reduces the write amplification by up to 86x and improves write performance by up to 61x while maintaining similar search performance.
机译：非易失性存储器（NVM）的出现引入了现有存储系统中性能优化的新机会。为了更好地利用其字节 - 可寻址和近DRAM性能，NVM可以连接在存储器总线上并通过负载/存储存储器指令而不是传统的块接口访问。在这种情况下，高速缓存行（通常64字节）成为易失性和非易失性设备之间的数据传输单元。但是，在NVM上写入的故障原子是存储位宽度（通常为8字节）。数据传输单元和原子性单元之间的这种不匹配可以引入基于节点的数据结构的写入放大和泄露数据一致性，例如B + -Trees。在本文中，我们提出了Wobtree，一个写优化的B + -tree，用于NVM，在没有昂贵的日志记录的情况下解决不匹配问题。 WobTree最小化从树节点到更小的子节点的更新粒度，并仔细配置其中的写入操作以确保崩溃一致性并减少写入放大。实验结果表明，与先前的持久性B + -Tree解决方案相比，WobTree将写入放大减少到86倍，并通过高达61倍提高写入性能，同时保持类似的搜索性能。

著录项

  • 来源
    《Frontiers of computer science》 |2021年第5期|155106.1-155106.15|共15页
  • 作者

    Haitao WANG; Zhanhuai LI; Xiao ZHANG; Xiaonan ZHAO; Song JIANG;

  • 作者单位

    School of Computer Science and Engineering Northwestern Polytechnical University Xi'An 710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Ministry of Industry and Information Technology Xi'An 710072 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'An 710072 China;

    School of Computer Science and Engineering Northwestern Polytechnical University Xi'An 710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Ministry of Industry and Information Technology Xi'An 710072 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'An 710072 China;

    School of Computer Science and Engineering Northwestern Polytechnical University Xi'An 710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Ministry of Industry and Information Technology Xi'An 710072 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'An 710072 China;

    School of Computer Science and Engineering Northwestern Polytechnical University Xi'An 710072 China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Ministry of Industry and Information Technology Xi'An 710072 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi'An 710072 China;

    Department of Computer Science and Engineering University of Texas at Arlington Arlington TX 76010 USA;

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

    non-volatile memory; B+-tree; atomic granularity mismatch; write amplification; performance optimization;

    机译：非易失性记忆;b + -tree;原子粒度不匹配;写放大;性能优化;

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号