By Topic

Adaptive Garbage Collection Mechanism for N-log Block Flash Memory Storage Systems

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

3 Author(s)
Yehua Du ; Coll. of Comput. Sci., Zhejiang Univ., Hangzhou ; Ming Cai ; Jinxiang Dong

Write operations in flash memory should be preceded by erase operations, which take an order of magnitude longer than writes. Therefore an update of a single byte causes an erasing of the whole block as well as restoration of a large amount of data. In order to avoid erasing during every update, non-in-place update schemes have been used. Obsolete data are later recycled by garbage collection. In this paper, we study a new garbage collection algorithm for the N-log block flash memory storage system, to reduce the recycling cost such as the number of erase operations and the number of data copies. The proposed scheme selects the victims according to the age and utilization. And selection algorithm changes dynamically with the I/O workload. Experimental results show that the proposed scheme reduces the extra erase operations greatly.

Published in:

Artificial Reality and Telexistence--Workshops, 2006. ICAT '06. 16th International Conference on

Date of Conference:

Nov. 29 2006-Dec. 1 2006