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 条
  • [41] dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction
    Pan, Feng-Feng
    Yue, Yin-Liang
    Xiong, Jin
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2017, 32 (01) : 41 - 54
  • [42] Studies on LSM-tree Based NoSQL Key-Value Stores
    Xu, Ming
    Xu, Xianbin
    Zheng, Fang
    Yin, Mengjia
    2016 3RD INTERNATIONAL CONFERENCE ON ECONOMIC, BUSINESS MANAGEMENT AND EDUCATIONAL INNOVATION (EBMEI 2016), PT 2, 2016, 55 : 726 - 730
  • [43] D2Comp: Efficient Offload of LSM-tree Compaction with Data Processing Units on Disaggregated Storage
    Ding, Chen
    Zhou, Jian
    Lu, Kai
    Li, Sicen
    Xiong, Yiqin
    Wan, Jiguang
    Zhan, Ling
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2024, 21 (03)
  • [44] Parallel Cache Prefetching for LSM-Tree Based Store: From Algorithm to Evaluation
    Zhang, Shuo
    Xu, Guangping
    Jia, YuLei
    Xue, Yanbing
    Zheng, Wenguang
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT I, 2022, 13155 : 222 - 236
  • [45] A Performance Optimization Method for Key-Value Store Based on LSM-tree
    Wang H.
    Li Z.
    Zhang X.
    Zhao X.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2019, 56 (08): : 1792 - 1802
  • [46] Revisiting the Design of LSM-tree Based OLTP Storage Engine with Persistent Memory
    Yan, Baoyue
    Cheng, Xuntao
    Jiang, Bo
    Chen, Shibin
    Shang, Canfang
    Wang, Jianying
    Huang, Gui
    Yang, Xinjun
    Cao, Wei
    Li, Feifei
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (10): : 1872 - 1885
  • [47] PRESS: Persistence Relaxation for Efficient and Secure Data Sanitization on Zoned Namespace Storage
    Hsieh, Yun-Shan
    Chen, Bo-Jun
    Huang, Po-Chun
    Chang, Yuan-Hao
    29TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2024, 2024, : 341 - 348
  • [48] Deduplication Triggered Compaction for LSM-tree Based Key-Value Store
    Zhang, Weitao
    Xu, Yinlong
    PROCEEDINGS OF 2018 IEEE 9TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS), 2018, : 719 - 722
  • [49] Research and implementation of asynchronous compaction mechanism of distributed database based on LSM-Tree
    Du Y.
    Liu W.
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2024, 42 (02): : 303 - 309
  • [50] Elastic and Stable Compaction for LSM-tree: A FaaS-Based Approach on TerarkDB
    Li, Jianchuan
    Jin, Peiquan
    Lin, Yuanjin
    Zhao, Ming
    Wang, Yi
    Guo, Kuankuan
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 3906 - 3915