Probability-based static wear-leveling algorithm for block and hybrid-mapping NAND flash memory

Owing to its desirable characteristics, flash memory has become attractive to different hardware vendors as a primary choice for data storage. However, because of a limited number of block-erase lifecycles, it has become mandatory to redesign the existing approaches to maximize the flash memory lifetime. Wear-leveling is a mechanism that helps to evenly distribute erase operations to all blocks and enhance lifetime. This research proposes probability-based static wear-leveling. Based on the Markov Chain theory, the future state depends on the present state. Mapping is implemented according to the present visit probability of each logical block in the next state. In each state, the wear-leveling distribution is computed using the standard deviation to determine whether it exceeds the threshold. If it does exceed the threshold, wear-leveling is maintained throughout all blocks in the flash memory by swapping the hot blocks with cold blocks. Using real system-based traces, we have proved that our proposal outperforms the existing design in terms of wear-leveling.

[1]  Sang-Won Lee,et al.  A log buffer-based flash translation layer using fully-associative sector translation , 2007, TECS.

[2]  Sang-Won Lee,et al.  A survey of Flash Translation Layer , 2009, J. Syst. Archit..

[3]  Tae-Sun Chung,et al.  FTL algorithms for NAND-type flash memories , 2011, Des. Autom. Embed. Syst..

[4]  Sang Lyul Min,et al.  A space-efficient flash translation layer for CompactFlash systems , 2002, IEEE Trans. Consumer Electron..

[5]  Tei-Wei Kuo,et al.  Improving Flash Wear-Leveling by Proactively Moving Static Data , 2010, IEEE Transactions on Computers.

[6]  Dae San Kim,et al.  Home network message specification for white goods and its applications , 2002, IEEE Trans. Consumer Electron..

[7]  Sheldon M. Ross,et al.  Introduction to Probability Models (4th ed.). , 1990 .

[8]  Li-Pin Chang,et al.  A low-cost wear-leveling algorithm for block-mapping solid-state disks , 2011, LCTES '11.

[9]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[10]  Tei-Wei Kuo,et al.  An adaptive striping architecture for flash memory storage systems of embedded systems , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[11]  Sivan Toledo,et al.  Algorithms and data structures for flash memories , 2005, CSUR.

[12]  Li-Pin Chang,et al.  On efficient wear leveling for large-scale flash-memory storage systems , 2007, SAC '07.

[13]  Kyu Ho Park,et al.  A hybrid flash translation layer with adaptive merge for SSDs , 2011, TOS.

[14]  Tae-Sun Chung,et al.  A Tri-Pool Dynamic Wear-Leveling Algorithm for Large Scale Flash Memory Storage Systems , 2011, 2011 International Conference on Information Science and Applications.

[15]  Sheldon M. Ross.  CHAPTER 4 – Markov Chains , 2010 .