View in EDS PDF Full Text

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 Ding1 tour1988@126.com, Yuanze Liu2 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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 185664518
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Block Sequence Based Garbage Collection Scheme for NAND Flash Memory.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tuo+Ding%22">Tuo Ding</searchLink><relatesTo>1</relatesTo><i> tour1988@126.com</i><br /><searchLink fieldCode="AR" term="%22Yuanze+Liu%22">Yuanze Liu</searchLink><relatesTo>2</relatesTo><i> 16600297947@163.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. Jun2025, Vol. 52 Issue 6, p1861-1872. 12p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Personal+computers%22">Personal computers</searchLink><br /><searchLink fieldCode="DE" term="%22Client%2Fserver+computing+equipment%22">Client/server computing equipment</searchLink><br /><searchLink fieldCode="DE" term="%22Flash+memory%22">Flash memory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=185664518
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 1861
    Subjects:
      – SubjectFull: Personal computers
        Type: general
      – SubjectFull: Client/server computing equipment
        Type: general
      – SubjectFull: Flash memory
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: A Block Sequence Based Garbage Collection Scheme for NAND Flash Memory.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tuo Ding
      – PersonEntity:
          Name:
            NameFull: Yuanze Liu
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 52
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1