# US 2025/0094078 A1 · Storage device and operating method of storage controller

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0094078 A1
- Document ID: US20250094078A1
- Status: Published application
- Kind: A1
- Application number: 18/965,086
- Filed: 2024-12-02
- Published: 2025-03-20
- Earliest claimed: 2022-08-31
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Eun Chu OH; Beomkyu SHIN
- Web page: https://patentgrep.com/patent/US20250094078A1

## CPC

- G06F 3/0655: {Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices}
- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 12/0253: {Garbage collection, i.e. reclamation of unreferenced memory}
- G06F 2212/1016: Performance improvement
- G06F 2212/7205: Cleaning, compaction, garbage collection, erase control
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

The present disclosure provides storage devices and methods for operating the same. In some embodiments, a storage device includes a non-volatile memory including a plurality of sub-blocks that are independently erasable, and a processor configured to control a garbage collection operation on the plurality of sub-blocks. The plurality of sub-blocks includes a plurality of first sub-blocks that have a first block size and a plurality of second sub-blocks that have a second block size. The second block size is different from the first block size. The processor is further configured to select a victim sub-block with a lowest ratio of a valid page count to an invalid page count from among the plurality of sub-blocks, and copy a valid page of the victim sub-block to a target sub-block from among the plurality of sub-blocks.

## Claims

### Claim 1

An operating method of a processor of a storage device, the operating method comprising:
performing a first garbage collection operation on first sub-blocks of a non-volatile memory, each of the first sub-blocks having a first block size; and
performing a second garbage collection operation on second sub-blocks of the non-volatile memory, each of the second sub-blocks having a second block size, the second block size being different from the first block size,
wherein the performing of the first garbage collection operation comprises:
selecting, as a first victim sub-block, a sub-block with a lowest valid page count from among the first sub-blocks;
copying a valid page of the first victim sub-block to a first target sub-block from among the first sub-blocks; and
performing a first erase operation on the first victim sub-block, and wherein the performing of the second garbage collection operation comprises:
selecting a second victim sub-block from among the second sub-blocks;
copying a valid page of the second victim sub-block to a second target sub-block from among the second sub-blocks; and
performing a second erase operation on the second victim sub-block.

### Claim 2 (depends on 1)

The operating method of claim 1, wherein:
the first sub-blocks respectively correspond to first memory stacks on a substrate, and
the second sub-blocks respectively correspond to second memory stacks on the first memory stacks.

### Claim 3 (depends on 1)

The operating method of claim 1, wherein:
the first garbage collection operation is performed independently from the second garbage collection operation, based on a block size of the first sub-blocks and the second sub-blocks.

### Claim 4 (depends on 1)

The operating method of claim 1,
wherein the copying of the valid page of the first victim sub-block comprises:
copying the valid page of the first victim sub-block to the first target sub-block, based on a first garbage collection management table of the first sub-blocks; and
wherein the copying of the valid page of the second victim sub-block comprises:
copying the valid page of the second victim sub-block to the second target sub-block, based on a second garbage collection management table of the second sub-blocks, the second victim sub-block having a lowest valid page count from among the second sub-blocks.

### Claim 5 (depends on 4)

The operating method of claim 4, wherein:
the first garbage collection management table is configured to store a valid page count of each of the first sub-blocks, and
the second garbage collection management table is configured to store a valid page count of each of the second sub-blocks.

### Claim 6 (depends on 4)

The operating method of claim 4,
wherein the performing of the first garbage collection operation further comprises:
updating the first garbage collection management table after copying the valid page of the first victim sub-block to the first target sub-block, and wherein the performing of the second garbage collection operation further comprises:
updating the second garbage collection management table after copying the valid page of the second victim sub-block to the second target sub-block.

### Claim 7 (depends on 1)

The operating method of claim 1, wherein:
each of the first sub-blocks is coupled to a first word line group comprising a plurality of first word lines stacked in a vertical direction,
each of the second sub-blocks is coupled to a second word line group comprising a plurality of second word lines stacked in the vertical direction, and
a number of first word lines comprised by the plurality of first word lines is different from a number of second word lines comprised by the plurality of second word lines.

### Claim 8 (depends on 1)

The operating method of claim 1, further comprising:
controlling, in a first mode, the first erase operation on the non-volatile memory in sub-block units; and
controlling, in a second mode, the second erase operation on the non-volatile memory in block units,
wherein each of the block units comprise at least two sub-blocks.

### Claim 9 (depends on 1)

The operating method of claim 1,
wherein the performing of the first garbage collection operation further comprises:
selecting the first victim sub-block with the lowest valid page count from among a plurality of first sub-blocks, when the lowest valid page count is greater than or equal to a threshold value, and
selecting the first victim sub-block with a highest invalid page count from among the plurality of first sub-blocks, when the highest valid page count is less than the threshold value,
wherein the threshold value changes based on at least one of a program/erase cycle count or a page migration time of each first sub-block of the plurality of first sub-blocks, and wherein the page migration time corresponds to a sum of program time, read time and erase time.

### Claim 10

A storage device, comprising:
a non-volatile memory comprising a plurality of memory stacks that are independently erasable, each memory stack of the plurality of memory stacks extending in a vertical direction on a substrate; and
a storage controller comprising a processor configured to control a garbage collection operation on the plurality of memory stacks,
wherein the plurality of memory stacks comprises:
a plurality of first memory stacks arranged on the substrate, each first memory stack of the plurality of first memory stacks being coupled to a first word line group and having a first size, the first word line group comprising a plurality of first word lines stacked in the vertical direction; and
a plurality of second memory stacks arranged on the plurality of first memory stacks, each second memory stack of the plurality of second memory stacks being coupled to a second word line group and having a second size, the second size being different from the first size, the second word line group comprising a plurality of second word lines stacked in the vertical direction, and
wherein the processor is further configured to:
select a victim memory stack with a lowest ratio of a valid page count to an invalid page count from among the plurality of memory stacks; and
copy a valid page of the victim memory stack to a target memory stack from among the plurality of memory stacks.

### Claim 11 (depends on 10)

The storage device of claim 10, wherein:
the first size corresponds to a number of first word lines comprised by the plurality of first word lines, and
the second size corresponds to a number of second word lines comprised by the plurality of second word lines.

### Claim 12 (depends on 10)

The storage device of claim 10, wherein:
the first size corresponds to a first total number of pages comprised by each first memory stack of the plurality of first memory stacks, and
the second size corresponds to a second total number of pages comprised by each second memory stack of the plurality of second memory stacks.

### Claim 13 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
calculate, for each memory stack of the plurality of memory stacks, a difference value between the invalid page count and the valid page count; and
select, as the victim memory stack, a memory stack having a largest difference value from among the plurality of memory stacks.

### Claim 14 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
calculate, for each memory stack of the plurality of memory stacks, a ratio value of the valid page count to the invalid page count; and
select, as the victim memory stack, a memory stack with a smallest ratio value from among the plurality of memory stacks.

### Claim 15 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
calculate, for each memory stack of the plurality of memory stacks, a ratio value of the valid page count to a stack size; and
select, as the victim memory stack, a memory stack with a smallest ratio value from among the plurality of memory stacks.

### Claim 16 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
manage a garbage collection management table of the plurality of memory stacks;
update the garbage collection management table according to the garbage collection operation on the plurality of memory stacks; and
control the garbage collection operation on the plurality of memory stacks based on the garbage collection management table.

### Claim 17 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
manage a mapping table storing physical addresses of the non-volatile memory respectively corresponding to logical addresses received from a host; and
wherein to copy the valid page of the victim memory stack comprises to update the mapping table after copying the valid page of the victim memory stack to the target memory stack.

### Claim 18 (depends on 10)

The storage device of claim 10, wherein the processor is further configured to:
select the victim memory stack with a lowest valid page count from among the plurality of memory stacks, when the valid page count is greater than or equal to a threshold value, and
select the victim memory stack with a highest invalid page count from among the plurality of memory stacks, when the valid page count is less than the threshold value,
wherein the threshold value changes based on at least one of a program/erase cycle count or a page migration time of each memory stack of the plurality of memory stacks, and wherein the page migration time corresponds to a sum of program time, read time and erase time.

### Claim 19

An operating method of a processor of a storage device, the operating method comprising:
selecting a victim memory stack from among first memory stacks and second memory stacks of a non-volatile memory, the first memory stacks being on a substrate, the second memory stacks being on the first memory stacks, each of the first memory stacks having a first size, each of the second memory stacks having a second size, the second size being different from the first size;
copying a valid page of the victim memory stack to a target memory stack; and
performing an erase operation on the victim memory stack,
wherein the selecting of the victim memory stack comprises at least one of:
selecting, as the victim memory stack, a first memory stack having a smallest ratio value of a valid page count to an invalid page count from among the first memory stacks and the second memory stacks;
selecting, as the victim memory stack, a second memory stack having a largest difference value between the invalid page count and the valid page count from among the first memory stacks and the second memory stacks; or
selecting, as the victim memory stack, a third memory stack having a smallest ratio value of the valid page count to a block size from among the first memory stacks and the second memory stacks.

### Claim 20 (depends on 19)

The operating method of claim 19, wherein the selecting of the victim memory stack further comprises:
selecting the victim memory stack with a lowest valid page count from among the first memory stacks and the second memory stacks, when the valid page count is greater than or equal to a threshold value, and
selecting the victim memory stack with a highest invalid page count from among the first memory stacks and the second memory stacks, when the valid page count is less than the threshold value,
wherein the threshold value changes based on at least one of a program/erase cycle count or a page migration time of each memory stack of the first memory stacks and the second memory stacks, and wherein the page migration time corresponds to a sum of program time, read time and erase time.
