# US 2025/0086059 A1 · Locked raid with compression for compute express link (cxl) applications having a shared cache line

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

- Number: US 2025/0086059 A1
- Document ID: US20250086059A1
- Status: Published application
- Kind: A1
- Application number: 18/778,641
- Filed: 2024-07-19
- Published: 2025-03-13
- Earliest claimed: 2023-08-02
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Emanuele CONFALONIERI; Marco SFORZIN
- Web page: https://patentgrep.com/patent/US20250086059A1

## CPC

- G06F 11/1096: {Parity calculation or recalculation after configuration or reconfiguration of the system}
- G06F 11/0727: {in a storage system, e.g. in a DASD or network based storage system (drivers for digital recording or reproducing units G06F3/06; circuits for error detection or correction within digital recording or reproducing units G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097)}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- 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

Provided is a device that includes an interface operatively coupled to a locked redundant array of independent disks (LRAID) including M (M>1) memory dice, the M memory dice stores stripes of data, and each stripe spanning over the M memory dice; and control circuitry that performs data compression on data to generate compressed data; stores the compressed data in the stripes; generates parity data of each stripe; determines, for each stripe, memory dice required to store the compressed data; determines, for each stripe, whether memory dice required to store the compressed data in each stripe is N memory dice or less; where N is an integer less than M; and determines, for each stripe, which stripes will store the parity data of a respective stripe based on the determination of whether the memory dice required to store the compressed data in the respective stripe is N memory dice or less.

## Claims

### Claim 1

A device comprising:
an interface configured to operatively couple to a locked redundant array of independent disks (LRAID) including M memory dice, the M memory dice of the LRAID being configured to store a plurality of stripes of data, and each of the stripes spanning over the M memory dice and wherein M is an integer greater than 1; and
control circuitry operatively coupled to the interface and at least configured to: obtain data;
perform data compression on the obtained data to generate compressed data; store the compressed data in the plurality of stripes;
determine, for each of the stripes, a number of memory dice required to store the compressed data;
determine, for each of the stripes, whether or not the number of memory dice that is required to store the compressed data in each of the stripes is N memory dice or less, wherein N is an integer less than M; and
determine, for each of the stripes, whether or not to store parity data of that one of the stripes based at least on the determination of whether or not the number of memory dice required to store the compressed data in the one of the stripes is N memory dice or less.

### Claim 2 (depends on 1)

The device according to claim 1, wherein the control circuitry is further configured to:
determine to store the parity data of the one of the stripes based on the determination that the number of memory dice required to store the compressed data in the one of the stripes is N memory dice or less; and
store the parity data of the one of the stripes in the one of the stripes.

### Claim 3 (depends on 1)

The device according to claim 1, wherein the control circuitry is further configured to:
determine to not store the parity data of the one of the stripes based at least on the determination that the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less.

### Claim 4 (depends on 1)

The device according to claim 1, wherein the control circuitry is further configured to:
count a number X of the stripes in which the number of memory dice required to store the compressed data in that respective one of the stripes is not N memory dice or less; and
determine whether or not to store parity data of the one of stripes based on the determination that the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less and also based on the counted number X.

### Claim 5 (depends on 4)

The device according to claim 4, wherein the control circuitry is further configured to:
determine to not store the parity data of the one of the stripes, in which the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less, based on a determination that the counted number X is below a threshold count value.

### Claim 6 (depends on 4)

The device according to claim 4, wherein the control circuitry is further configured to:
determine to store the parity data of the one of the stripes, in which the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less, based on a determination that the counted number X is above a threshold count value.

### Claim 7 (depends on 6)

The device according to claim 6, wherein the control circuitry is further configured to:
store the parity data of the one of the stripes in another one of the plurality stripes.

### Claim 8

A device comprising:
an interface configured to operatively couple to a locked redundant array of independent disks (LRAID) including M memory dice, the M memory dice of the LRAID being configured to store a plurality of stripes of data, and each of the stripes spanning over the M memory dice and wherein M is an integer greater than 1; and
control circuitry operatively coupled to the interface and at least configured to:
obtain data;
perform data compression on the obtained data to generate compressed data;
store the compressed data in the plurality of stripes;
determine the compression ratio of the compressed data stored in a first one of the plurality of stripes; and
determine whether or not to store parity data of the first one of the stripes based at least on the determined compression ratio.

### Claim 9 (depends on 8)

The device according to claim 8, wherein the control circuitry is further configured to:
determine to store the parity data of the first one of the stripes based on the determination that the determined compression ratio is above a compression ratio threshold; and
determine to not store the parity data of the first one of the stripes based at least on the determination that the determined compression ratio is below the compression ratio threshold.

### Claim 10 (depends on 8)

The device according to claim 8, wherein the control circuitry is further configured to:
count a number X of the stripes in which a compression ratio of compressed data stored in each of the respective stripes is below a compression ratio threshold; and
determine whether or not to store parity data of the first one of stripes based on a determination that the determined compression ratio of the compressed data stored in the first one the stripes is below the compression ratio threshold and also based on the counted number X.

### Claim 11

A method comprising:
operatively coupling an interface to a locked redundant array of independent disks (RAID) including M memory dice, the M memory dice of the LRAID being configured to store a plurality of stripes of data, and each of the stripes spanning over the M memory dice and wherein M is an integer greater than 1;
obtaining data;
performing data compression on the obtained data to generate compressed data;
storing the compressed data in the plurality of stripes;
determining, for each of the stripes, a number of memory dice required to store the compressed data;
determining, for each of the stripes, whether or not the number of memory dice that is required to store the compressed data in each of the stripes is N memory dice or less, wherein N is an integer less than M; and
determining, for each of the stripes, whether or not to store parity data of that one of the stripes based at least on the determination of whether or not the number of memory dice required to store the compressed data in the one of the stripes is N memory dice or less.

### Claim 12 (depends on 11)

The method according to claim 11, further comprising:
determining to store the parity data of the one of the stripes based on the determination that the number of memory dice required to store the compressed data in the one of the stripes is N memory dice or less; and
storing the parity data of the one of the stripes in the one of the stripes.

### Claim 13 (depends on 11)

The method according to claim 11, further comprising:
determining to not store the parity data of the one of the stripes based at least on the determination that the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less.

### Claim 14 (depends on 11)

The method according to claim 11, further comprising:
counting a number X of the stripes in which the number of memory dice required to store the compressed data in that respective one of the stripes is not N memory dice or less; and
determining whether or not to store parity data of the one of stripes based on the determination that the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less and also based on the counted number.

### Claim 15 (depends on 14)

The method according to claim 14, further comprising:
determining to not store the parity data of the one of the stripes, in which the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less, based on a determination that the counted number X is below a threshold count value.

### Claim 16 (depends on 14)

The method according to claim 14, further comprising:
determining to store the parity data of the one of the stripes, in which the number of memory dice required to store the compressed data in the one of the stripes is not N memory dice or less, based on a determination that the counted number X is above a threshold count value.

### Claim 17 (depends on 16)

The method according to claim 16, further comprising:
storing the parity data of the one of the stripes in another one of the plurality stripes.

### Claim 18

A method comprising:
operatively coupling an interface to a locked redundant array of independent disks (LRAID) including M memory dice, the M memory dice of the LRAID being configured to store a plurality of stripes of data, and each of the stripes spanning over the M memory dice and wherein M is an integer greater than 1;
obtaining data;
performing data compression on the obtained data to generate compressed data;
storing the compressed data in the plurality of stripes;
determining a compression ratio of the compressed data stored in a first one of the plurality of stripes; and
determining whether or not to store parity data of the first one of the stripes based at least on the determined compression ratio.

### Claim 19 (depends on 18)

The method according to claim 18, further comprising:
determining to store the parity data of the first of the stripes based on the determination that the determined compression ratio is above a compression ratio threshold; and
determining to not store the parity data of the first one of the stripes based at least on the determination that the determined compression ratio is below the compression ratio threshold.

### Claim 20 (depends on 18)

The method according to claim 18, further comprising:
counting a number X of the stripes in which a compression ratio of compressed data stored in each of the respective stripes is below a compression ratio threshold; and
whether or not to store parity data of the first one of stripes based on a determination that the determined compression ratio of the compressed data stored in the first one the stripes is below the compression ratio threshold and also based on the counted number X.
