# US 2022/0398156 A1 · Distributed multi-level protection in a hyper-converged infrastructure

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

- Number: US 2022/0398156 A1
- Document ID: US20220398156A1
- Status: Published application
- Kind: A1
- Application number: 17/876,400
- Filed: 2022-07-28
- Published: 2022-12-15
- Earliest claimed: 2010-10-01
- Assignees: Pure Storage, Inc.
- Applicants: Pure Storage, Inc.
- Inventors: Ethan L. Miller; John Colgrove; Robert Lee
- Web page: https://patentgrep.com/patent/US20220398156A1

## CPC

- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/108: {Parity data distribution in semiconductor storages, e.g. in SSD}
- G06F 11/3034: {where the computing system component is a storage system, e.g. DASD based or network based (digital input from or digital output to record carriers G06F3/06; digital recording or reproducing 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/3055: {Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available (error or fault processing without redundancy G06F11/0703; error detection or correction by redundancy in data representation G06F11/08; error detection or correction of the data by redundancy in operations G06F11/14; error detection or correction by redundancy in hardware G06F11/16)}
- G06F 11/3442: {for planning or managing the needed capacity}
- G06F 2211/1057: Parity-multiple bits-RAID6, i.e. RAID 6 implementations
- G06F 2211/1059: Parity-single bit-RAID5, i.e. RAID 5 implementations
- H04L 67/1097: 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]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A storage system includes a plurality of storage nodes. Each storage node of the plurality of storage nodes includes a plurality of non-volatile memory modules. The storage system also includes a processor operatively coupled to the plurality of storage nodes, to perform a method. The method includes receiving incoming data. The method further includes storing the incoming data in a redundant array of independent drives (RAID) stripe in the data storage system. The RAID stripe includes groups of data shards. Each group of data shards and a respective group parity shard are stored across the plurality of nodes of the data storage system. A set of stripe parity shards are stored in a first storage node of the plurality of storage nodes.

## Claims

### Claim 1

A method, comprising:
receiving incoming data to be stored in a data storage system comprising a plurality of storage nodes, wherein each storage node comprises a plurality of non-volatile memory modules; and
storing the incoming data in a redundant array of independent drives (RAID) stripe in the data storage system, wherein:
the RAID stripe comprises groups of data shards;
each group of data shards and a respective group parity shard are stored across the plurality of nodes of the data storage system; and
a set of stripe parity shards are stored in a first storage node of the plurality of storage nodes.

### Claim 2 (depends on 1)

The method of claim 1, wherein each storage node stores one of a data shard from each group of data shards, a group parity shard for a respective group of data shards, or a stripe parity shard.

### Claim 3 (depends on 1)

The method of claim 1, wherein the groups of data shards are not stored on the first storage node.

### Claim 4 (depends on 1)

The method of claim 1, wherein the plurality of storage nodes are distributed across multiple chassis of the data storage system.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
receiving a request for a first data shard of a first group of data shards stored on the one storage node;
determining that the first data shard is inaccessible; and
reconstructing the first data shard based on remaining data shards of the first group of data shards and a first group parity shard for the first group of data shards.

### Claim 6 (depends on 5)

The method of claim 5, wherein determining that the first data shard is inaccessible comprises:
determining that a first storage node of the plurality of storage nodes is inoperable, wherein the first data shard is stored on the one storage node.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
providing access to first data shards while the first storage node is rebooted.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
determining that one or more data shards are inaccessible;
determining whether the one or more data shards can be relocated to the first storage node; and
transmitting a message indicating that the one or more data shards can be relocated to the first storage node.

### Claim 9 (depends on 1)

The method of claim 1, wherein the storage system is configured to recover data shards when one data shard from each group is inaccessible and when one or more additional data shards are inaccessible.

### Claim 10 (depends on 1)

The method of claim 1, wherein the storage system is configured to recover data shards when one or more storage nodes are inaccessible.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
generating the respective group parity shards for each group of data shards based on the incoming data; and
generating the set of stripe parity shards based on the incoming data.

### Claim 12

A storage system, comprising:
a plurality of storage nodes, each storage node of the plurality of storage nodes comprising a plurality of non-volatile memory modules; and
a processor operatively coupled to the plurality of storage nodes, to perform a method, comprising:
receiving incoming data; and
storing the incoming data in a redundant array of independent drives (RAID) stripe in the data storage system, wherein:
the RAID stripe comprises groups of data shards;
each group of data shards and a respective group parity shard are stored across the plurality of nodes of the data storage system; and
a set of stripe parity shards are stored in a first storage node of the plurality of storage nodes.

### Claim 13 (depends on 12)

The storage system of claim 12, wherein each storage node stores one of a data shard from each group of data shards, a group parity shard for a respective group of data shards, or a stripe parity shard.

### Claim 14 (depends on 12)

The storage system of claim 12, wherein the groups of data shards are not stored on the first storage node.

### Claim 15 (depends on 12)

The storage system of claim 12, wherein the plurality of storage nodes are distributed across multiple chassis of the data storage system.

### Claim 16 (depends on 12)

The storage system of claim 12, wherein the processing device is further configured to:
receive a request for a first data shard of a first group of data shards stored on the one storage node;
determine that the first data shard is inaccessible; and
reconstruct the first data shard based on remaining data shards of the first group of data shards and a first group parity shard for the first group of data shards.

### Claim 17 (depends on 16)

The storage system of claim 16, wherein to determine that the first data shard is inaccessible the processing device is further configured to:
determine that one storage node of the plurality of storage nodes is inoperable, wherein the first data shard is stored on the one storage node.

### Claim 18 (depends on 12)

The storage system of claim 12, wherein the processing device is further configured to:
determine that one or more data shards are inaccessible;
determine whether the one or more data shards can be relocated to the first storage node; and
transmit a message indicating that the one or more data shards can be relocated to the first storage node.

### Claim 19 (depends on 12)

The storage system of claim 12, wherein the processing device is further configured to:
recover data shards when one data shard from each group is inaccessible and when one or more additional data shards are inaccessible.

### Claim 20

A non-transitory, computer-readable media having instructions thereupon which, when executed by a processor, cause the processor to perform a method comprising:
receiving incoming data to be stored in a data storage system comprising a plurality of storage nodes, wherein each storage node comprises a plurality of non-volatile memory modules; and
storing the incoming data in a redundant array of independent drives (RAID) stripe in the data storage system, wherein:
the RAID stripe comprises groups of data shards;
each group of data shards and a respective group parity shard are stored across the plurality of nodes of the data storage system; and
a set of stripe parity shards are stored in a first storage node of the plurality of storage nodes.
