arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.4816cs.PF
收藏

大规模固态存储系统的随机建模:分析、设计权衡与优化

Stochastic Modeling of Large-Scale Solid-State Storage Systems: Analysis, Design Tradeoffs and Optimization

Yongkun Li, Patrick P. C. Lee, John C. S. Lui

摘要:

固态硬盘(SSD)因其高I/O性能和低能耗而在移动设备、台式机和数据中心中得到广泛部署。由于SSD会将数据写入不适当的位置,因此需要使用垃圾回收(GC)来擦除和回收包含无效数据的空间。然而,GC会带来额外的写入,这会阻碍I/O性能,而SSD块只能承受有限数量的擦除。因此,在GC的设计空间上存在性能-耐久性权衡。为了表征最佳的权衡,本文制定了一个分析模型,探讨了所有GC算法的最优设计空间。首先,我们提出了一个随机马尔可夫链模型,捕捉的I/O动态的大规模SSD,并适应平均场的方法来获得渐近稳态性能。我们进一步证明了该模型的收敛性,并将该模型推广到所有类型的工作负载。受此模型的启发,我们提出了一个随机贪心算法(RGA),可以沿着最佳的权衡曲线与可调参数。使用跟踪驱动的模拟与SSD插件的RGA上,我们演示了如何可以参数化,以实现性能和耐久性的权衡。

英文摘要:

Solid state drives (SSDs) have seen wide deployment in mobiles, desktops, and data centers due to their high I/O performance and low energy consumption. As SSDs write data out-of-place, garbage collection (GC) is required to erase and reclaim space with invalid data. However, GC poses additional writes that hinder the I/O performance, while SSD blocks can only endure a finite number of erasures. Thus, there is a performance-durability tradeoff on the design space of GC. To characterize the optimal tradeoff, this paper formulates an analytical model that explores the full optimal design space of any GC algorithm. We first present a stochastic Markov chain model that captures the I/O dynamics of large-scale SSDs, and adapt the mean-field approach to derive the asymptotic steady-state performance. We further prove the model convergence and generalize the model for all types of workload. Inspired by this model, we propose a randomized greedy algorithm (RGA) that can operate along the optimal tradeoff curve with a tunable parameter. Using trace-driven simulation on DiskSim with SSD add-ons, we demonstrate how RGA can be parameterized to realize the performance-durability tradeoff.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑