Dynamic-size Superblock Management based on Buddy System for Modern SSDs

Superblocks are widely used in SSDs to exploit internal parallelism thus improving I/O throughput. Although dynamic-size superblock schemes enhance space utilization for varied workloads, they introduce internal fragmentation and impact overall performance. To address this issue, we propose Buddy , a novel dynamic-size superblock management scheme based on the buddy system, which adapts to I/O patterns by dynamically splitting and merging superblocks. This approach maintains large blocks to preserve parallelism for sequential writes and generates smaller blocks on demand to handle random writes effectively. We further introduce the expansion GC mechanism to adaptively adjust GC unit size based on I/O intensity and GC efficiency for alleviating fragmentation and preserving SSD parallelism. Trace-driven evaluations with real-world benchmarks demonstrate that our approach can reduce average I/O latency and GC-induced data migration by 47.0 % and 24.5 %, respectively, compared to state-of-the-art superblock management techniques.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2026-10-22
DOI
https://doi.org/10.1145/3860055
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

Dynamic-size Superblock Management based on Buddy System for Modern SSDs

Weiyong Zhang, Li Cai, Jiaojiao Wu, Jianwei Liao et al.
ACM Transactions on Architecture and Code Optimization
Advanced Data Storage Technologies
article

Dynamic-size Superblock Management based on Buddy System for Modern SSDs

Weiyong Zhang, Li Cai, Jiaojiao Wu, Jianwei Liao, Zhigang Cai, Zhibing Sha, Huanhuan Tian, Yuyang He
article en

Abstract

Superblocks are widely used in SSDs to exploit internal parallelism thus improving I/O throughput. Although dynamic-size superblock schemes enhance space utilization for varied workloads, they introduce internal fragmentation and impact overall performance. To address this issue, we propose Buddy , a novel dynamic-size superblock management scheme based on the buddy system, which adapts to I/O patterns by dynamically splitting and merging superblocks. This approach maintains large blocks to preserve parallelism for sequential writes and generates smaller blocks on demand to handle random writes effectively. We further introduce the expansion GC mechanism to adaptively adjust GC unit size based on I/O intensity and GC efficiency for alleviating fragmentation and preserving SSD parallelism. Trace-driven evaluations with real-world benchmarks demonstrate that our approach can reduce average I/O latency and GC-induced data migration by 47.0 % and 24.5 %, respectively, compared to state-of-the-art superblock management techniques.

ACM Transactions on Architecture and Code Optimization
Southwest University (CN)
Openalex Percentile: Top 11%
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.

Laika access coming soon
Dynamic-size Superblock Management based on Buddy System for Modern SSDs — Weiyong Zhang, Li Cai, et al. · ACM Transactions on Architecture and Code Optimization (2026) | TGRS Research Map | TGRS