Cart (Loading....) | Create Account
Close category search window
 

Efficient garbage collection policy and block management method for NAND flash memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kee-Hoon Jang ; Dept. of Embedded Software Eng., Sungkyunkwan Univ., Suwon, South Korea ; Tae Hee Han

Recently NAND flash memories are widely used as storage alternatives to hard disks in embedded systems. Different characteristics of NAND flash memories from hard disks include: a limited block erase count, the impossibility of in-place update, and asymmetry in operation granularity. Thus various garbage collection techniques for the NAND flash memories have been proposed. However, existing garbage collection techniques impede block wear leveling because they use the same method for both hot and cold data. In this paper, we propose efficient garbage collection and block management methods to improve block wear leveling and garbage collection speed. First of all, data are classified into three types according to modification frequency--hot data, cold data, and warm data--and different types of data are stored in different blocks. The erase cost is calculated considering data type, and then garbage collection is performed for the blocks whose erase costs exceed the threshold value. In addition, different block lists are created in RAM by data type, and the blocks are arranged in the order of their erase cost. In experiment results, the proposed methods show that the deviation value of block erase count is sharply reduced in comparison with other algorithms. The average time of the garbage collection decreases by up to 22.1% compares to the Greedy algorithm and up to 19.5% compares to the PCP algorithm.

Published in:

Mechanical and Electronics Engineering (ICMEE), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

1-3 Aug. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.