# US 2026/0064281 A1 · Optimizing data reliability using erase retention

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

- Number: US 2026/0064281 A1
- Document ID: US20260064281A1
- Status: Published application
- Kind: A1
- Application number: 19/379,259
- Filed: 2025-11-04
- Published: 2026-03-05
- Earliest claimed: 2022-11-30
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Zhongguang XU; Ronit Roneel PRAKASH; Murong LANG; Ching-Huang LU; Zhenming ZHOU
- Web page: https://patentgrep.com/patent/US20260064281A1

## CPC

- G06F 3/0613: {in relation to throughput}
- G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, systems, and apparatuses include moving a portion of memory to a garbage pool in response to determining that the portion of memory is invalid. The portion of memory is erased in response to determining that the portion of memory is invalid. A request to move an additional portion of memory to a free pool from the garbage pool is received. A free pool includes a queue including erased portions of memory, which serve as next portions of memory to fulfill subsequent cursor requests. The erased portion of memory is moved from the garbage pool to the free pool.

## Claims

### Claim 1

A method comprising:
receiving a request to move an erased portion of memory from a garbage pool to a free pool, wherein the garbage pool includes erased portions of memory and the free pool includes a queue comprising a plurality of erased portions of memory, which serve as next portions of memory to fulfill subsequent cursor requests;
moving the erased portion of memory from the garbage pool to the free pool;
scanning the erased portion of memory moved to the free pool; and
performing a re-erase operation on the erased portion of memory based on a result of the scan.

### Claim 2 (depends on 1)

The method of claim 1, wherein scanning the erased portion of memory comprises performing a detect erased page scan on the portion of memory and wherein the re-erase operation is a shallow erase operation performed if the detect erased page scan fails.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
periodically scanning the plurality of erased portions of memory in the queue; and
performing the re-erase operation on the plurality of erased portions of memory based on the result of the scan.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
moving a portion of memory to a garbage pool in response to determining that the portion of memory is invalid; and
erasing the portion of memory in response to determining that the portion of memory is invalid.

### Claim 5 (depends on 4)

The method of claim 4, wherein erasing the portion of memory is further in response to moving the portion of memory to a garbage pool.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
receiving a cursor request;
selecting a portion of memory from the free pool queue to satisfy the cursor request; and
requesting an additional portion of memory from the garbage pool for the free pool.

### Claim 7 (depends on 6)

The method of claim 6, wherein selecting the portion of memory from the queue is based on one of:
how long each of the plurality of erased portions of memory has been in the free pool; and
program erase cycles for each of the plurality of erased portions of memory.

### Claim 8

A non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to:
receive a request to move an erased portion of memory from a garbage pool to a free pool, wherein the garbage pool includes erased portions of memory and the free pool includes a queue comprising a plurality of erased portions of memory, which serve as next portions of memory to fulfill subsequent cursor requests;
move the erased portion of memory from the garbage pool to the free pool;
scan the erased portion of memory moved to the free pool; and
perform a re-erase operation on the erased portion of memory based on a result of the scan.

### Claim 9 (depends on 8)

The non-transitory computer-readable storage medium of claim 8, wherein scanning the erased portion of memory comprises performing a detect erased page scan on the portion of memory and wherein the re-erase operation is a shallow erase operation performed if the detect erased page scan fails.

### Claim 10 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein the processing device is further to:
periodically scan the plurality of erased portions of memory in the queue; and
perform the re-erase operation on the plurality of erased portions of memory based on the result of the scan.

### Claim 11 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein the processing device is further to:
move a portion of memory to a garbage pool in response to determining that the portion of memory is invalid; and
erase the portion of memory in response to determining that the portion of memory is invalid.

### Claim 12 (depends on 11)

The non-transitory computer-readable storage medium of claim 11, wherein erasing the portion of memory is further in response to moving the portion of memory to a garbage pool.

### Claim 13 (depends on 9)

The non-transitory computer-readable storage medium of claim 9, wherein the processing device is further to:
receive a cursor request;
select a portion of memory from the free pool queue to satisfy the cursor request; and
request an additional portion of memory from the garbage pool for the free pool.

### Claim 14 (depends on 13)

The non-transitory computer-readable storage medium of claim 13, wherein selecting the portion of memory from the queue is based on one of:
how long each of the plurality of erased portions of memory has been in the free pool; and
program erase cycles for each of the plurality of erased portions of memory.

### Claim 15

A system comprising:
a plurality of memory devices; and
a processing device, operatively coupled with the plurality of memory devices, to:
receive a request to move an erased portion of memory from a garbage pool to a free pool, wherein the garbage pool includes erased portions of memory and the free pool includes a queue comprising a plurality of erased portions of memory, which serve as next portions of memory to fulfill subsequent cursor requests;
move the erased portion of memory from the garbage pool to the free pool;
perform a detect erased page scan on the erased portion of memory moved to the free pool; and
perform a shallow erase operation on the erased portion of memory in response to the detect erased page scan failing.

### Claim 16 (depends on 15)

The system of claim 15, wherein the processing device is further to:
periodically scan the plurality of erased portions of memory in the queue.

### Claim 17 (depends on 15)

The system of claim 15, wherein the processing device is further to:
move a portion of memory to a garbage pool in response to determining that the portion of memory is invalid; and
erase the portion of memory in response to determining that the portion of memory is invalid.

### Claim 18 (depends on 17)

The system of claim 17, wherein erasing the portion of memory is further in response to moving the portion of memory to a garbage pool.

### Claim 19 (depends on 15)

The system of claim 15, wherein the processing device is further to:
receive a cursor request;
select a portion of memory from the free pool queue to satisfy the cursor request; and
request an additional portion of memory from the garbage pool for the free pool.

### Claim 20 (depends on 19)

The system of claim 19 wherein selecting the portion of memory from the queue is based on one of:
how long each of the plurality of erased portions of memory has been in the free pool; and
program erase cycles for each of the plurality of erased portions of memory.
