Close category search window
 

COPR: a cost-oriented recycling policy for flash translation layer

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)
Jiakun Liu ; Electr. Eng. Dept., Seoul Nat. Univ., Seoul, South Korea ; Wonyong Sung

A coarse-grained log block allocation policy has been proved to be efficient in the newly emerging blockgroup- based NAND flash translation layers (FTL). However, these FTL schemes can result in a large garbage collection overhead in terms of valid page copy and erase operations, because they employ a least recently used (LRU) algorithm as their victim selection policy for garbage collection. In this paper, we propose a cost-oriented recycling policy (CORP) to remedy this problem, where the victim block-groups for garbage collection are selected based on the recycling operation overhead and the write access possibility of each logical block. Trace-driven simulations show that the proposed scheme greatly reduces the garbage collection overhead and promises a more efficient FTL solution.

Published in:
Consumer Electronics, IEEE Transactions on  (Volume:56 ,  Issue: 2 )

Date of Publication: May 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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.