GR-FB block cleaning scheme in flash memory.

Citation

Abd.Rahiman, Amir Rizaan and Mansor, Noridayu and Abdul Halin, Alfian and Putra Sumari, and Kamarulhaili, Hailiza (2011) GR-FB block cleaning scheme in flash memory. In: International Conference on Advances in Information and Communication Technologies 2011, 1-2 Dec. 2011, Amsterdam, Netherland. .

Abstract

Flash memory is a non-volatitle memory that offers several superior advantages as a data storage device in many electronic gadgets. However its two operational characteristics, namely 1) Out-place updating and 2) Cleaning process will affect its performance as an efficient storage sub-system if not managed wisely. This paper proposes a new block cleaning scheme, called Greedy and Frequency-based (GR-FB). The scheme combines the victim block selection procedure and the valid-data re-organizing procedure to improve the block cleaning process performance. The trace-driven simulations have shown the GR-FB scheme performs better than existing cleaning process schemes where the cleaning cost is reduced at least by 8% and the wear-leveling level for all blocks in the memory array are nearly equal.

Download File

PDF
ID 27351.pdf
Restricted to Repository staff only
Download (320kB)

Additional Metadata

Item Type:	Conference or Workshop Item (Paper)
Divisions:	Faculty of Computer Science and Information Technology
Notes:	Full text are available at Special Collection Division Office
Keywords:	Flash memory; Cleaning process; Wear-leveling; Frequency; Simulation; Data.
Depositing User:	Erni Suraya Abdul Aziz
Date Deposited:	03 Mar 2014 03:44
Last Modified:	31 Oct 2014 08:30
URI:	http://psasir.upm.edu.my/id/eprint/27351
Statistic Details:	View Download Statistic

Actions (login required)

View Item