RBC: A Randomness-Resistant Block-Grained Compaction Strategy for ZNS SSDs

Research on LSM-tree optimization for ZNS-based SSDs has garnered significant attention. Existing studies primarily focus on reducing garbage collection overhead by ensuring consistent data block lifetimes within a zone. While many works address cascading write amplification between LSM-trees and ZNS SSDs, few evaluate the effectiveness of existing WA reduction strategies on ZNS. Block compaction, a commonly adopted optimization approach, reduces write amplification by shrinking the compaction granularity to the data block level and remapping reusable data blocks. However, Block compaction causes fragmentation in ZNS SSDs, increasing data migration and write amplification during zone reclamation. Moreover, fragmentation reduces the prefetch cache hit rate of ZNS file systems, thereby increasing data block read latency and negatively impacting user read operations and range lookup performance. Additionally, block compaction with a low proportion of reusable data blocks generates more random read operations, leading to higher compaction latency and blocking user read/write operations. To address these issues, we propose the Randomness-Resistant Block-grained Compaction (RBC) strategy. RBC uses a remapping table to track the location of fragmented data blocks, allowing for more efficient prefetch cache utilization. Furthermore, RBC reduces the data migration overhead caused by fragmentation by delaying the reclamation of highly fragmented zones and migrating remapped data blocks during idle periods. RBC introduces a dynamic compaction strategy that applies block-level compaction for high dirty block ratios and switches to file-level compaction for low dirty block ratios. Additionally, it implements a low-CPU-overhead dirty block detection strategy. Experimental results show that RBC improves throughput by 69% and 37% compared to traditional RocksDB and other block-grained compaction methods, respectively. RBC also improves range query performance by 1.75x compared to other block-grained compaction techniques.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2025-09-16
DOI
https://doi.org/10.1145/3764588
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

RBC: A Randomness-Resistant Block-Grained Compaction Strategy for ZNS SSDs

Wei Tong, Tianqi Zhan, Zhengyong Wang, Dan Feng et al.
ACM Transactions on Architecture and Code Optimization
Advanced Data Storage Technologies
article

RBC: A Randomness-Resistant Block-Grained Compaction Strategy for ZNS SSDs

Wei Tong, Tianqi Zhan, Zhengyong Wang, Dan Feng, Shu Li
article en

Abstract

Research on LSM-tree optimization for ZNS-based SSDs has garnered significant attention. Existing studies primarily focus on reducing garbage collection overhead by ensuring consistent data block lifetimes within a zone. While many works address cascading write amplification between LSM-trees and ZNS SSDs, few evaluate the effectiveness of existing WA reduction strategies on ZNS. Block compaction, a commonly adopted optimization approach, reduces write amplification by shrinking the compaction granularity to the data block level and remapping reusable data blocks. However, Block compaction causes fragmentation in ZNS SSDs, increasing data migration and write amplification during zone reclamation. Moreover, fragmentation reduces the prefetch cache hit rate of ZNS file systems, thereby increasing data block read latency and negatively impacting user read operations and range lookup performance. Additionally, block compaction with a low proportion of reusable data blocks generates more random read operations, leading to higher compaction latency and blocking user read/write operations. To address these issues, we propose the Randomness-Resistant Block-grained Compaction (RBC) strategy. RBC uses a remapping table to track the location of fragmented data blocks, allowing for more efficient prefetch cache utilization. Furthermore, RBC reduces the data migration overhead caused by fragmentation by delaying the reclamation of highly fragmented zones and migrating remapped data blocks during idle periods. RBC introduces a dynamic compaction strategy that applies block-level compaction for high dirty block ratios and switches to file-level compaction for low dirty block ratios. Additionally, it implements a low-CPU-overhead dirty block detection strategy. Experimental results show that RBC improves throughput by 69% and 37% compared to traditional RocksDB and other block-grained compaction methods, respectively. RBC also improves range query performance by 1.75x compared to other block-grained compaction techniques.

ACM Transactions on Architecture and Code OptimizationVol. 22(4)
Alibaba Group (United States) (US), Wuhan National Laboratory for Optoelectronics (CN)
Openalex Percentile: Top 71%
Advanced Data Storage Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.