# US 2022/0066678 A1 · Multi-page parity data storage in a memory device

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

- Number: US 2022/0066678 A1
- Document ID: US20220066678A1
- Status: Published application
- Kind: A1
- Application number: 17/002,374
- Filed: 2020-08-25
- Published: 2022-03-03
- Earliest claimed: 2020-08-25
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Harish R. Singidi; Ashutosh Malshe; Vamsi Pavan Rayaprolu; Kishore Kumar Muchherla
- Web page: https://patentgrep.com/patent/US20220066678A1

## CPC

- G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket}
- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/064: {Management of blocks}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 11/1004: {to protect a block of data words, e.g. CRC or checksum (G06F11/1076 takes precedence; security arrangements for protecting computers or computer systems against unauthorized activity G06F21/00)}
- G06F 11/1012: {using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence)}
- H03M 7/6011: {Encoder aspects}
- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M 7/6041: {Compression optimized for errors}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

parity data storage location. Responsive to determining that a first size of the stored parity data satisfies a first condition, the processing device initiates execution of a compression algorithm to compress the stored parity data. Responsive to determining that a second size of the parity data resulting from the execution of the compression algorithm satisfies a second condition, the processing device performs a scan operation to release at least a subset of the stored parity data.

## Claims

### Claim 1

A method comprising:
performing a write operation on a page of a plurality of pages of a data unit of a memory device, to store host data in the page of the data unit;
generating a parity page for the host data stored in the page of the data unit;
adding the parity page to parity data stored at a parity data storage location;
responsive to determining that a first size of the parity data stored at the parity data storage location satisfies a first condition, initiating execution of a compression algorithm to compress the parity data stored at the parity data storage location; and
responsive to determining that a second size of the parity data resulting from the execution of the compression algorithm satisfies a second condition, performing a scan operation to release at least a subset of the parity data stored at the parity data storage location.

### Claim 2 (depends on 1)

The method of claim 1 further comprising:
continuing to execute the compression algorithm to compress the parity data stored at the parity data storage location as additional parity pages are added to the parity data as a result of new write operations.

### Claim 3 (depends on 1)

The method of claim 1, wherein executing the compression algorithm further comprises:
performing an exclusive-OR operation on two or more parity pages of the parity data stored at the parity data storage location to generate a single parity page, wherein the two or more parity pages correspond to two or more pages of host data that are located outside a blast radius from each other in the data unit;
marking the single parity page as a multi-page parity page;
storing the single parity page at the parity data storage location; and
releasing the two or more parity pages.

### Claim 4 (depends on 1)

The method of claim 1, wherein the parity data storage location comprises a second memory device of a memory sub-system, the memory sub-system further comprising the memory device.

### Claim 5 (depends on 1)

The method of claim 1, wherein the parity data storage location comprises a second unit of the memory device, wherein the second unit is dedicated to holding exclusively parity data.

### Claim 6 (depends on 1)

The method of claim 1, wherein determining that the first size of the parity data stored at the parity data storage location satisfies the first condition comprises determining that a first percentage of consumed parity blocks of the parity data storage location exceeds a first threshold.

### Claim 7 (depends on 6)

The method of claim 6, wherein determining that the second size of the parity data stored at the parity data storage location satisfies the second condition comprises determining that a second percentage of consumed parity blocks of the parity data storage location exceeds a second threshold, the second threshold is higher than the first threshold.

### Claim 8 (depends on 1)

The method of claim 1, wherein performing the scan operation further comprises:
scanning a subset of the plurality of pages of the data unit to determine whether at least one page of the subset has a defect; and
responsive to determining that none of the subset of the plurality of pages has a defect, releasing parity data associated with the subset of the plurality of pages.

### Claim 9

A system comprising:
a memory device; and
a processing device, operatively coupled with the memory device, to perform operations comprising:
creating a parity page for host data stored in a page of a plurality of pages of a data unit of a memory device;
adding the parity page to parity data stored at a parity data storage location;
responsive to determining that the plurality of pages of the data unit satisfies a first condition, initiating execution of a compression algorithm to compress the parity data stored at the parity data storage location; and
responsive to determining that a size of the parity data resulting from the execution of the compression algorithm satisfies a second condition, performing a scan operation to release at least a subset of the parity data stored at the parity data storage location.

### Claim 10 (depends on 9)

The system of claim 9, wherein determining that the plurality of pages of the data unit satisfies the first condition further comprises:
determining that at least two pages of the plurality of pages storing host data are located outside a blast radius from each other in the data unit.

### Claim 11 (depends on 9)

The system of claim 9, wherein the processing device is to perform operations further comprising:
continuing to execute the compression algorithm to compress the parity data stored at the parity data storage location as additional parity pages are added to the parity data as a result of write operations.

### Claim 12 (depends on 9)

The system of claim 9, wherein executing the compression algorithm further comprises:
performing an exclusive-OR operation on two or more parity pages of the parity data stored at the parity data storage location to generate a single parity page, wherein the two or more parity pages correspond to two or more pages of the host data that are located outside a blast radius from each other in the data unit;
marking the single parity page as a multi-page parity page;
storing the single parity page at the parity data storage location; and
releasing the two or more parity pages.

### Claim 13 (depends on 9)

The system of claim 9, wherein the parity data storage location comprises a second memory device of a memory sub-system, the memory sub-system further comprising the memory device.

### Claim 14 (depends on 9)

The system of claim 9, wherein the parity data storage location comprises a second unit of the memory device, wherein the second unit is dedicated to holding exclusively parity data.

### Claim 15 (depends on 9)

The system of claim 9, wherein determining that the size of the parity data stored at the parity data storage location satisfies the second condition comprises determining that a percentage of consumed parity blocks of the parity data storage location exceeds a threshold.

### Claim 16

A non-transitory computer-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to perform operations comprising:
performing a write operation on a page of a plurality of pages of a data unit of a memory device, to store host data in the page of the data unit;
generating a parity page for the host data stored in the page of the data unit;
adding the parity page to parity data stored at a parity data storage location;
responsive to determining that a first size of the parity data stored at the parity data storage location satisfies a first condition, initiating execution of a compression algorithm to compress the parity data stored at the parity data storage location; and
responsive to determining that a second size of the parity data resulting from the execution of the compression algorithm satisfies a second condition, performing a scan operation to release at least a subset of the parity data stored at the parity data storage location.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the operations further comprise:
continuing to execute the compression algorithm to compress the parity data stored at the parity data storage location as additional parity pages are added to the parity data as a result of new write operations.

### Claim 18 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein determining that the first size of the parity data stored at the parity data storage location satisfies the first condition comprises:
determining that a first percentage of consumed parity blocks of the parity data storage location exceeds a first threshold.

### Claim 19 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein determining that the second size of the parity data stored at the parity data storage location satisfies the second condition comprises:
determining that a second percentage of consumed parity blocks of the parity data storage location exceeds a second threshold, the second threshold is higher than the first threshold.

### Claim 20 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein performing the scan operation comprises:
scanning a subset of the plurality of pages of the data unit to determine whether at least one page of the subset has a defect; and
responsive to determining that none of the subset of the plurality of pages has a defect, releasing parity data associated with the subset of the plurality of pages.
