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 条
  • [1] NobLSM: An LSM-tree with Non-blocking Writes for SSDs
    Dang, Haoran
    Ye, Chongnan
    Hu, Yanpeng
    Wang, Chundong
    PROCEEDINGS OF THE 59TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC 2022, 2022, : 403 - 408
  • [2] NobLSM: An LSM-tree with Non-blocking Writes for SSDs
    Dang, Haoran
    Ye, Chongnan
    Hu, Yanpeng
    Wang, Chundong
    Proceedings - Design Automation Conference, 2022, : 403 - 408
  • [3] eZNS: An Elastic Zoned Namespace for Commodity ZNS SSDs
    Min, Jaehong
    Zhao, Chenxingyu
    Liu, Ming
    Krishnamurthy, Arvind
    PROCEEDINGS OF THE 17TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, OSDI 2023, 2023, : 461 - 477
  • [4] Land of Oz: Resolving Orderless Writes in Zoned Namespace SSDs
    Wang, Yingjia
    Zhou, You
    Wu, Fei
    Zhang, Jie
    Yang, Ming-Chang
    IEEE TRANSACTIONS ON COMPUTERS, 2024, 73 (11) : 2520 - 2533
  • [5] Pipelined Compaction for the LSM-tree
    Zhang, Zigang
    Yue, Yinliang
    He, Bingsheng
    Xiong, Jin
    Chen, Mingyu
    Zhang, Lixin
    Sun, Ninghui
    2014 IEEE 28TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, 2014,
  • [6] Efficient Wear-Leveling-Aware Data Placement for LSM-Tree based key-value store on ZNS SSDs
    Zhang, Runyu
    Zhou, Lening
    Li, Mingjie
    Tan, Yunlin
    Yang, Chaoshu
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2024, 36 (07)
  • [7] dCompaction: Delayed Compaction for the LSM-Tree
    Pan, Fengfeng
    Yue, Yinliang
    Xiong, Jin
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2017, 45 (06) : 1310 - 1325
  • [8] WA-Zone: Wear-Aware Zone Management Optimization for LSM-Tree on ZNS SSDs
    Long, Linbo
    He, Shuiyong
    Shen, Jingcheng
    Liu, Renping
    Tan, Zhenhua
    Gao, Congming
    Liu, Duo
    Zhong, Kan
    Jiang, Yi
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2024, 21 (01)
  • [9] An LSM-Tree Index for Spatial Data
    He, Junjun
    Chen, Huahui
    ALGORITHMS, 2022, 15 (04)
  • [10] dCompaction: Delayed Compaction for the LSM-Tree
    Fengfeng Pan
    Yinliang Yue
    Jin Xiong
    International Journal of Parallel Programming, 2017, 45 : 1310 - 1325