23 October 2009 Efficient wear-leveling algorithm for Nand flash memory based solid-state disk
Author Affiliations +
Abstract
As a result of Nand flash memory being widely used as storage medium, solid-state disk has inherited the intrinsic hardware features from the Nand flash memory. Unlike standard block access devices, the flash memory media needs to be erased before program operations and the block endurance is limited. Therefore distributing erasure operations evenly across the whole flash memory blocks is a hot research issue for designing solid-state disk. In this pager, an efficient wear-leveling algorithm is put forward. The basic idea is that: for each writing operation, new data will be written to the block which have a minimum number of erasure cycles in the whole erased blocks, and the block storing static data and with relatively small number of erasure cycles will be forced to move their data to the erased block with high number of erasure cycles. The infrequent updated data will stay in old block until wear-leveling takes effect again. In addition, an efficient page mapping table technology is also proposed; this technology can reduce the average read response time. Extensive simulation and comparison were performed, and the results show that the provided algorithm, needing small memory space can make all the blocks of flash having the average number of erasure cycles, which significantly improves the lifespan of solid-state disk by more than 70% and reduces extra block erasure cycles and extra live-data coping.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gongye Zhou, Gongye Zhou, Jincai Chen, Jincai Chen, Tao Li, Tao Li, Honglian Hu, Honglian Hu, } "Efficient wear-leveling algorithm for Nand flash memory based solid-state disk", Proc. SPIE 7517, Photonics and Optoelectronics Meetings (POEM) 2009: Optical Storage and New Storage Technologies, 751708 (23 October 2009); doi: 10.1117/12.843352; https://doi.org/10.1117/12.843352
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT


Back to Top