SplitZNS: Towards an Efficient LSM-Tree on Zoned Namespace SSDs

被引:8
|
作者
Huang, Dong [1 ]
Feng, Dan [1 ]
Liu, Qiankun [1 ]
Ding, Bo [1 ]
Zhao, Wei [1 ]
Wei, Xueliang [1 ]
Tong, Wei [1 ]
机构
[1] Huazhong Univ Sci & Technol, WNLO, Luoyu Rd 1037, Wuhan, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Zoned Namespace; LSM-tree; garbage collection;
D O I
10.1145/3608476
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Zoned Namespace (ZNS) Solid State Drive (SSD) is a nascent form of storage device that offers novel prospects for the Log Structured Merge Tree (LSM-tree). ZNS exposes erase blocks in SSD as append-only zones, enabling the LSM-tree to gain awareness of the physical layout of data. Nevertheless, LSM-tree on ZNS SSDs necessitates Garbage Collection (GC) owing to the mismatch between the gigantic zones and relatively small Sorted String Tables (SSTables). Through extensive experiments, we observe that a smaller zone size can reduce data migration in GC at the cost of a significant performance decline owing to inadequate parallelism exploitation. In this article, we present SplitZNS, which introduces small zones by tweaking the zone-to-chip mapping to maximize GC efficiency for LSM-tree on ZNS SSDs. Following the multi-level peculiarity of LSM-tree and the inherent parallel architecture of ZNS SSDs, we propose a number of techniques to leverage and accelerate small zones to alleviate the performance impact due to underutilized parallelism. (1) First, we use small zones selectively to prevent exacerbating write slowdowns and stalls due to their suboptimal performance. (2) Second, to enhance parallelism utilization, we propose SubZone Ring, which employs a perchip FIFO buffer to imitate a large zone writing style; (3) Read Prefetcher, which prefetches data concurrently through multiple chips during compactions; (4) and Read Scheduler, which assigns query requests the highest priority. We build a prototype integrated with SplitZNS to validate its efficiency and efficacy. Experimental results demonstrate that SplitZNS achieves up to 2.77x performance and reduces data migration considerably compared to the lifetime-based data placement.
引用
收藏
页数:26
相关论文
共 50 条
  • [31] SuccinctKV: a CPU-efficient LSM-tree Based KV Store with Scan-based Compaction
    Zhang, Yinan
    Yang, Shun
    Hu, Huiqi
    Yang, Chengcheng
    Cai, Peng
    Zhou, Xuan
    ACM Transactions on Architecture and Code Optimization, 2024, 21 (04)
  • [32] Towards Read-Intensive Key-Value Stores with Tidal Structure Based on LSM-Tree
    Wang, Yi
    Wu, Shangyu
    Mao, Rui
    2020 25TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2020, 2020, : 307 - 312
  • [33] MUTANT: Balancing Storage Cost and Latency in LSM-Tree Data Stores
    Yoon, Hobin
    Yang, Juncheng
    Kristjansson, Sveinn Fannar
    Sigurdarson, Steinn E.
    Vigfusson, Ymir
    Gavrilovska, Ada
    PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '18), 2018, : 162 - 173
  • [34] pLSM: A Highly Efficient LSM-Tree Index Supporting Real-Time Big Data Analysis
    Wang, Jin
    Zhang, Yong
    Gao, Yang
    Xing, Chunxiao
    2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), 2013, : 240 - 245
  • [35] Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure
    Kaufman, Adi
    Hershcovitch, Moshik
    Morrison, Adam
    PROCEEDINGS OF THE 2023 USENIX ANNUAL TECHNICAL CONFERENCE, 2023, : 719 - 733
  • [36] SA-LSM: Optimize Data Layout for LSM-tree Based Storage using Survival Analysis
    Zhang, Teng
    Tan, Jian
    Cai, Xin
    Wang, Jianying
    Li, Feifei
    Sun, Jianling
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (10): : 2161 - 2174
  • [37] Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store
    Huang, Haoyu
    Ghandeharizadeh, Shahram
    SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2021, : 749 - 763
  • [38] 基于更新热点感知的LSM-Tree查询优化
    林清音
    陈志广
    大数据, 2023, 9 (01) : 126 - 140
  • [39] dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction
    Feng-Feng Pan
    Yin-Liang Yue
    Jin Xiong
    Journal of Computer Science and Technology, 2017, 32 : 41 - 54
  • [40] Reducing Write Amplification of LSM-Tree with Block-Grained Compaction
    Wang, Xiaoliang
    Jin, Peiquan
    Hua, Bei
    Long, Hai
    Huang, Wei
    2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 3119 - 3131