A Block Sequence Based Garbage Collection Scheme for NAND Flash Memory.

Saved in:

Bibliographic Details
Title:	A Block Sequence Based Garbage Collection Scheme for NAND Flash Memory.
Authors:	Tuo Ding¹ tour1988@126.com, Yuanze Liu² 16600297947@163.com
Source:	IAENG International Journal of Computer Science. Jun2025, Vol. 52 Issue 6, p1861-1872. 12p.
Subjects:	Personal computers, Client/server computing equipment, Flash memory, Algorithms
Abstract:	NAND flash memory is a mainstream storage technology widely used in modern devices, including personal computers and servers. It offers advantages such as shock resistance and high throughput. However, due to the limitations of erase/program cycles, NAND flash faces challenges such as limited lifespan, block wear, and uneven wear distribution. Additionally, garbage collection involves extensive erase operations, significantly impacting the endurance of flash memory. To mitigate block wear and enhance wear leveling, this paper proposes a block sequence-based garbage collection scheme (BS GC) for NAND flash. The proposed approach introduces two key improvements: (1) an optimized block recycling policy and (2) a hot-cold data identification and separation mechanism using a block sequence table. Furthermore, the block sequence table is utilized to track block update frequency and erase counts. Compared to existing algorithms, BS GC offers higher efficiency while requiring less RAM. [ABSTRACT FROM AUTHOR]
	Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	NAND flash memory is a mainstream storage technology widely used in modern devices, including personal computers and servers. It offers advantages such as shock resistance and high throughput. However, due to the limitations of erase/program cycles, NAND flash faces challenges such as limited lifespan, block wear, and uneven wear distribution. Additionally, garbage collection involves extensive erase operations, significantly impacting the endurance of flash memory. To mitigate block wear and enhance wear leveling, this paper proposes a block sequence-based garbage collection scheme (BS GC) for NAND flash. The proposed approach introduces two key improvements: (1) an optimized block recycling policy and (2) a hot-cold data identification and separation mechanism using a block sequence table. Furthermore, the block sequence table is utilized to track block update frequency and erase counts. Compared to existing algorithms, BS GC offers higher efficiency while requiring less RAM. [ABSTRACT FROM AUTHOR]
ISSN:	1819656X