On the Cost of Near-Perfect Wear Leveling in Flash-Based SSDs

被引:0
作者
Van Houdt, Benny [1 ]
机构
[1] Univ Antwerp, Dept Comp Sci, Middelheimlaan 1, B-2020 Antwerp, Belgium
关键词
SSD; write amplification; Wear Leveling; garbage collection; GARBAGE COLLECTION; PERFORMANCE; ALGORITHMS;
D O I
10.1145/3576855
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wear leveling (WL) techniques in flash-based SSDs aim at distributing the erase cycles as uniformly as possible across the memory blocks within the SSD to extend its life span. The downside of any WL technique is that it causes additional internal write operations, thereby increasing the so-called write amplification (WA) factor, which equals the ratio between the total number of writes performed and the number of writes requested by the host system. In this article, we address the question whether near-perfect WL is possible at low costs in terms of the WA factor. We answer this question affirmatively by presenting a simple randomized algorithm that combines WL with garbage collection. This algorithm guarantees that the wear is nearly perfectly balanced at all times while causing a low increase in the WA. This is demonstrated mathematically using a mean field model in case of uniform random writes and using trace-driven simulation experiments for general workloads.
引用
收藏
页数:22
相关论文
共 28 条
[1]   A class of mean field interaction models for computer and communication systems [J].
Benaim, Michel ;
Le Boudec, Jean-Yves .
PERFORMANCE EVALUATION, 2008, 65 (11-12) :823-838
[2]   Performance of greedy garbage collection in flash-based solid-state drives [J].
Bux, Werner ;
Iliadis, Ilias .
PERFORMANCE EVALUATION, 2010, 67 (11) :1172-1186
[3]  
Chen F, 2009, PERF E R SI, V37, P181
[4]  
Chiang ML, 1999, SOFTWARE PRACT EXPER, V29, P267, DOI 10.1002/(SICI)1097-024X(199903)29:3<267::AID-SPE233>3.0.CO
[5]  
2-T
[6]   Analytic Models of SSD Write Performance [J].
Desnoyers, Peter .
ACM TRANSACTIONS ON STORAGE, 2014, 10 (02)
[7]  
Ethier S.N., 1986, Wiley Series in Probability and Statistics
[8]   Algorithms and data structures for flash memories [J].
Gal, E ;
Toledo, S .
ACM COMPUTING SURVEYS, 2005, 37 (02) :138-163
[9]   Markov chains with discontinuous drifts have differential inclusion limits [J].
Gast, Nicolas ;
Gaujal, Bruno .
PERFORMANCE EVALUATION, 2012, 69 (12) :623-642
[10]  
Grupp L.M., 2012, P 10 USENIX C FILE S, P2