.png){kind=icon}
.png){kind=icon}
Return
Swap-aware Garbage Collection Algorithm for NAND Flash-based Consumer Electronics
.png){kind=icon}
PRE
AI
DOI：10.1109/TCE.2014.6780926.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
NAND flash memory is a popular storage device for consumer electronics and it is exploited to be swap space for extending the limited main memory of consumer electronics. Due to the out-of-place update scheme provided by NAND flash memory to solve its erase-before-write hardware constraint, garbage collection should be performed to reclaim garbage in terms of invalid pages and obtain free space in terms of free blocks. The garbage collection, which consists of a series of copy operations and erase operations, is energy-consuming. In order to reduce the energy consumption, a swap-aware garbage collection algorithm for NAND flash-based consumer electronics is proposed in this paper. The proposed algorithm focuses on reducing the garbage collection overhead and improving the endurance of NAND flash memory. Experimental results show that the proposed algorithm is superior to the existing garbage collection algorithms in terms of the number of copy operations, the number of erase operations, the degree of wear-leveling, and energy consumption(1).
Keywords:
Garbage collection
NAND flash memory
Consumer electronics
Storage device
Journal
IF:
10.9
Papers:
5.1K
Citations:
6.8K