Revisiting Multi-threaded Compaction in LSM-trees: Enabling Compaction Pipelining

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

We reveal that modern LSM-tree multi-threaded compaction suffers from limited cross-level parallelism, which prevents concurrent compactions across multiple levels. This limitation leads to an imbalance in thread assignment and causes throughput to saturate even when more threads are added. To address this limitation, we propose a compaction strategy called DownForce. DownForce enables multiple compactions to be executed across levels by introducing non-blocking pipelined compaction, allowing level-wise compactions to proceed simultaneously. This resolves thread imbalance and achieves fully multi-threaded compaction. DownForce is implemented in RocksDB, a representative LSM-tree-based key-value store, and supports both leveled and tiered compaction. In our evaluation, leveled compaction enhanced with DownForce achieves an average of 1.44 × higher thread-level parallelism and delivers up to 1.81 × higher throughput under write-intensive workloads, compared to the conventional multi-threaded leveled compaction.

키워드

Key-Value StoreLog-Structured Merge-treeParallel Processing
제목
Revisiting Multi-threaded Compaction in LSM-trees: Enabling Compaction Pipelining
저자
Byun, Hong SuYoo, Hong HyeonPark, Sung Yong
DOI
10.1145/3754598.3754675
발행일
2025-12-20
유형
Proceedings Paper
저널명
54th International Conference on Parallel Processing, ICPP 2025 - Main Conference Proceedings
페이지
794 ~ 803