Compaction-aware zone allocation for LSM based key-value store on ZNS SSDs

Hee-Rock Lee, Chang-Gyu Lee, Seungjin Lee, Youngjae Kim
{"title":"Compaction-aware zone allocation for LSM based key-value store on ZNS SSDs","authors":"Hee-Rock Lee, Chang-Gyu Lee, Seungjin Lee, Youngjae Kim","doi":"10.1145/3538643.3539743","DOIUrl":null,"url":null,"abstract":"Unlike traditional block-based SSDs, Zoned Namespace (ZNS) SSDs expose storage through the zoned block interface, completely eliminating the need for in-device garbage collection (GC) and relinquishing this responsibility to applications. As a result, application-aware data placement decisions give the opportunity for applications on the host to perform efficient GC. Meanwhile, RocksDB for ZNS SSD places data with similar invalidation times (lifetimes) in the same zone through ZenFS (a user-level file system) using the Lifetime-based Zone Allocation algorithm (LIZA), and minimizes the GC overhead of valid data copy when reclaiming a zone. However, LIZA, which allocates zones by predicting the lifetime of each SSTable according to the level of the hierarchical structure of the LSM-tree, is very inefficient in minimizing the write amplification (WA) problem due to inaccurate predictions of SSTable lifetimes. Instead, based on our observation that the deletion time of SSTables in the LSM-tree is solely determined by the compaction process, we propose a novel Compaction-Aware Zone Allocation algorithm (CAZA) that allows the newly created SSTables to be deleted together after merging in the future. CAZA is implemented in RocksDB's ZenFS and our extensive evaluations show that CAZA significantly reduces the WA overhead compared to LIZA.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3538643.3539743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Unlike traditional block-based SSDs, Zoned Namespace (ZNS) SSDs expose storage through the zoned block interface, completely eliminating the need for in-device garbage collection (GC) and relinquishing this responsibility to applications. As a result, application-aware data placement decisions give the opportunity for applications on the host to perform efficient GC. Meanwhile, RocksDB for ZNS SSD places data with similar invalidation times (lifetimes) in the same zone through ZenFS (a user-level file system) using the Lifetime-based Zone Allocation algorithm (LIZA), and minimizes the GC overhead of valid data copy when reclaiming a zone. However, LIZA, which allocates zones by predicting the lifetime of each SSTable according to the level of the hierarchical structure of the LSM-tree, is very inefficient in minimizing the write amplification (WA) problem due to inaccurate predictions of SSTable lifetimes. Instead, based on our observation that the deletion time of SSTables in the LSM-tree is solely determined by the compaction process, we propose a novel Compaction-Aware Zone Allocation algorithm (CAZA) that allows the newly created SSTables to be deleted together after merging in the future. CAZA is implemented in RocksDB's ZenFS and our extensive evaluations show that CAZA significantly reduces the WA overhead compared to LIZA.
在ZNS ssd上基于键值存储的LSM的紧凑感知区域分配
与传统的基于块的ssd不同,分区命名空间(ZNS) ssd通过分区块接口公开存储,完全消除了设备内垃圾收集(GC)的需要,并将此责任交给应用程序。因此,应用程序感知的数据放置决策为主机上的应用程序提供了执行高效GC的机会。同时,用于ZNS SSD的RocksDB通过ZenFS(用户级文件系统)使用基于生命周期的zone Allocation算法(lisa)将具有相似失效时间(生命周期)的数据放置在相同的zone中,并在回收zone时最小化有效数据副本的GC开销。然而,LIZA根据lsm树的层次结构级别预测每个SSTable的生存期来分配区域,由于对SSTable生存期的预测不准确,在最小化写放大(write amplification, WA)问题方面效率非常低。相反,根据我们的观察,LSM-tree中sstable的删除时间仅由压缩过程决定,我们提出了一种新的紧凑感知区域分配算法(CAZA),该算法允许新创建的sstable在将来合并后一起删除。在RocksDB的ZenFS中实现了CAZA,我们的广泛评估表明,与LIZA相比,CAZA显著降低了WA开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信