IP Library Granted Patent US 10,489,291
Granted Patent B2
US 10,489,291 · App. 15/877,547 · Granted Nov 26, 2019

Garbage collection method for a data storage apparatus by finding and cleaning a victim block

Inventors: Yen-Lan Hsu (Santa Clara, CA); Bo-Shian Hsu (Santa Clara, CA); Po-Chien Chang (Santa Clara, CA)
Assignee: Goke US Research Laboratory
G06F12/0253G06F3/064G06F3/0652G06F3/0679G06F12/0246G06F2212/2022G06F2212/7201G06F2212/7205
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,489,291
App. No.
15/877,547
Granted
Nov 26, 2019
Kind
B2
Abstract

A data storage apparatus executes a garbage collection method. The data storage apparatus includes a NAND flash memory including blocks each of which includes pages. In the garbage collection method, a destination block is selected from the blocks. Mapping tables and a relevance bitmap are built before writing user data into the destination block. Each bit in the relevance bitmap is related to one of the mapping tables. A victim block is selected from the blocks. At least one of the mapping tables are read according to the relevance bitmap for the victim block. It is determined whether the pages, one after another, of the victim block are in the read mapping tables. The page is set to be a valid page if a page of the victim block is in a read mapping table. Data in the valid pages is written into another block.

Claims (26)

1. A garbage collection method for a data storage apparatus comprising the steps of:

providing a data storage apparatus with a NAND flash memory comprising blocks each of which comprises pages;

selecting a destination block from the blocks;

building mapping tables to map logic addresses of the user data to physical addresses and building a relevance bitmap before writing user data into the destination block, wherein each bit in the relevance bitmap is related to one of the mapping tables, and the step of building the mapping tables further comprises the steps of:

determining whether if the destination block is a new block;

initializing a new relevance bitmap and a new mapping table if the destination block is a new block;

writing the user data into the destination block; and

updating the relevance bitmap and the mapping table;

selecting a victim block from the blocks;

reading at least one of the mapping tables according to the relevance bitmap for the victim block;

determining whether if the pages, one after another, of the victim block are in the mapping table that has been read;

if a page of the victim block is in the mapping table that has been read, setting the page to be a valid page; and

writing data in the valid pages into another block.

2. The garbage collection method according to claim 1 , wherein the step of setting the page to be a valid page further comprises the

step of building a valid-page bitmap comprising bits each of which is related to one of the pages of the victim block.

3. The garbage collection method according to claim 2 , wherein the step of building a valid-page bitmap further comprises the steps of:

setting some of the bits of the valid-page bitmap related to the valid pages to be “1”; and

setting the other bits of the valid-page bitmap to be “0”.

4. The garbage collection method according to claim 1 , wherein the step of building mapping tables sequentially comprises the steps of:

determining whether if the destination block is full;

writing the relevance bitmap into the NAND flash memory if the destination block is full;

determining whether if the mapping table is full; and

writing the mapping tables into the NAND flash memory if the mapping table is full.

5. The garbage collection method according to claim 1 , wherein the step of building mapping tables further comprises the steps of:

setting some of the bits of the relevance bitmap related to the mapping tables to be “1”; and

setting the other bits of the relevance bitmap to be “0”.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 18, 2024
From: CHIGMA TECHNOLOGY
To: CHENGDU XINSHENG INTEGRATED CIRCUIT CO., LTD.
Reel/Frame 068622/0721 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 21, 2023
From: GOKE US RESEARCH LABORATORY
To: CHIGMA TECHNOLOGY
Reel/Frame 063403/0349 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 23, 2018
From: HSU, YEN-LAN; HSU, BO-SHIAN; CHANG, PO-CHIEN
To: GOKE US RESEARCH LABORATORY
Reel/Frame 044697/0500 →
Continuity (1)
Related Publication 20190227925A1 · Jul 25, 2019