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 条
  • [21] MDCF: Multiple Dynamic Cuckoo Filters for LSM-Tree
    Yao, Xingfei
    Xie, Taotao
    Chen, Xiaowei
    Shen, Zhaoyan
    Cai, Xiaojun
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2023, PT VI, 2024, 14492 : 202 - 218
  • [22] Building a Fast and Efficient LSM-tree Store by Integrating Local Storage with Cloud Storage
    Xu, Peng
    Zhao, Nannan
    Wan, Jiguang
    Liu, Wei
    Chen, Shuning
    Zhou, Yuanhui
    Albahar, Hadeel
    Liu, Hanyang
    Tang, Liu
    Tan, Zhihu
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2022, 19 (03)
  • [23] LTG-LSM: The Optimal Structure in LSM-tree Combined with Reading Hotness
    Yu, JiaPing
    Chen, HuaHui
    Qian, JiangBo
    Dong, YiHong
    2020 IEEE 26TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2020, : 1 - 8
  • [24] Optimization of LSM-Tree for Key-Value Stores
    Wu S.
    Xie J.
    Wang Y.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2020, 57 (11): : 2432 - 2441
  • [25] HotKey-LSM: A Hotness-Aware LSM-Tree for Big Data Storage
    Wang, Yi
    Jin, Peiquan
    Wan, Shouhong
    2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, : 5849 - 5851
  • [26] LayerBF: A Space Allocation Policy for Bloom Filter in LSM-Tree
    Li, Jiaoyang
    Fan, Zhixin
    Yue, Yinliang
    Yao, Zekun
    Liu, Jinzhou
    Zhou, Jiang
    WEB AND BIG DATA, PT III, APWEB-WAIM 2023, 2024, 14333 : 492 - 506
  • [27] Lifetime-Leveling LSM-Tree Compaction for ZNS SSD
    Jung, Jeeyoon
    Shin, Dongkun
    PROCEEDINGS OF THE 2022 14TH ACM WORKSHOP ON HOT TOPICS IN STORAGE AND FILE SYSTEMS, HOTSTORAGE 2022, 2022, : 100 - 105
  • [28] LSM-tree Compaction Acceleration Using In-storage Processing
    Lim, Minje
    Jung, Jeeyoon
    Shin, Dongkun
    2021 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS-ASIA (ICCE-ASIA), 2021,
  • [29] SEALDB: An Efficient LSM-tree Based KV Store on SMR Drives with Sets and Dynamic Bands
    Yao, Ting
    Tan, Zhihu
    Wan, Jiguang
    Huang, Ping
    Zhang, Yiwen
    Xie, Changsheng
    He, Xubin
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (11) : 2595 - 2607
  • [30] Efficient Data Placement for Zoned Namespaces (ZNS) SSDs
    Wang, Hongtao
    Liu, Yang
    Jin, Peiquan
    Lu, Mingchen
    Zhuang, Xiangyu
    Lin, Yuanjing
    Guo, Kuankuan
    NETWORK AND PARALLEL COMPUTING, NPC 2022, 2022, 13615 : 302 - 314