基于块失效时间推断的日志存储写放大抑制算法
Separating Data via Block Invalidation Time Inference for Write Amplification Reduction in Log-Structured Storage
摘要:
日志结构存储已广泛应用于存储系统的各个领域,但其垃圾回收由于实时数据的重写而引起写放大(WA)。我们发现,存在一个最佳的数据放置方案,最大限度地减少WA使用未来的知识块失效时间(BIT)的每个写入块,但它是不可行的,在实践中实现。我们提出了一种新的数据放置算法,以减少WA,SepBIT,其目的是从存储工作负载中推断出写入块的BIT,并将块单独放置到具有类似估计BIT的组中。我们表明,通过数学和生产跟踪分析,SepBIT有效地推断BIT,利用实际存储工作负载中的写偏斜属性。跟踪分析和原型实验表明,SepBIT减少WA和提高I/O吞吐量,分别与国家的最先进的数据布局方案。SepBIT目前已部署用于支持阿里云的日志结构块存储管理。
英文摘要:
Log-structured storage has been widely deployed in various domains of storage systems, yet its garbage collection incurs write amplification (WA) due to the rewrites of live data. We show that there exists an optimal data placement scheme that minimizes WA using the future knowledge of block invalidation time (BIT) of each written block, yet it is infeasible to realize in practice. We propose a novel data placement algorithm for reducing WA, SepBIT, that aims to infer the BITs of written blocks from storage workloads and separately place the blocks into groups with similar estimated BITs. We show via both mathematical and production trace analyses that SepBIT effectively infers the BITs by leveraging the write skewness property in practical storage workloads. Trace analysis and prototype experiments show that SepBIT reduces WA and improves I/O throughput, respectively, compared with state-of-the-art data placement schemes. SepBIT is currently deployed to support the log-structured block storage management at Alibaba Cloud.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。