A Group-Based Hybrid Wear-Leveling Algorithm for Flash Memory Storage Systems

Wear-leveling algorithm is required in most flash memory controllers to prolong the lifetime of flash memory by distributing the erase operations evenly across the whole flash memory. This paper proposes a group based wear-leveling algorithm which can dramatically reduce the RAM space required by we...

Full description

Saved in:
Bibliographic Details
Published in2012 Third International Conference on Digital Manufacturing & Automation pp. 58 - 61
Main Authors Husheng Liu, Hongshan Nie, Qiang Liu, Qiyou Xie, Miao Li, Hui Xu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2012
Subjects
Automation
Flash Memory
Manufacturing
Storage Systems
Wear-Leveling
Online AccessGet full text

Cover

More Information
Summary:Wear-leveling algorithm is required in most flash memory controllers to prolong the lifetime of flash memory by distributing the erase operations evenly across the whole flash memory. This paper proposes a group based wear-leveling algorithm which can dramatically reduce the RAM space required by wear-leveling algorithm while maintaining the wear-leveling performance. We adopt random wear-leveling policy which requires very little RAM space inside a group to make the data in the group move around and the wear in the group respectively even. And a threshold controlled static wear-leveling policy is adopted among different groups to make the average wear of different groups even. A series of trace-driven simulations show that our group based algorithm consumes only 78% of RAM space compare with previous group-based wear-leveling algorithm which require complex data structure, while maintaining nearly the same wear-leveling performance.
ISBN:9781467322171
1467322172
DOI:10.1109/ICDMA.2012.14