The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 09, 2025

Filed:

Aug. 01, 2024
Applicant:

Pure Storage, Inc., Santa Clara, CA (US);

Inventors:

Greg R. Dhuse, Chicago, IL (US);

Vance T. Thornton, Columbus, OH (US);

Jason K. Resch, Warwick, RI (US);

Ilya Volvovski, Chicago, IL (US);

Dustin M. Hendrickson, Chicago, IL (US);

John Quigley, Chicago, IL (US);

Assignee:

Pure Storage, Inc., Santa Clara, CA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/10 (2006.01); G06F 11/07 (2006.01); G06F 11/14 (2006.01); G06F 11/16 (2006.01); G06F 16/13 (2019.01); H04L 9/32 (2006.01); H04L 9/40 (2022.01); H04L 67/06 (2022.01); H04W 12/041 (2021.01); H04W 12/0431 (2021.01); H04W 12/30 (2021.01); G06F 21/31 (2013.01); G06F 21/62 (2013.01); H04L 67/1097 (2022.01); H04W 12/10 (2021.01);
U.S. Cl.
CPC ...
G06F 11/1092 (2013.01); G06F 11/0727 (2013.01); G06F 11/141 (2013.01); G06F 11/167 (2013.01); G06F 16/13 (2019.01); H04L 9/3242 (2013.01); H04L 9/3247 (2013.01); H04L 9/3263 (2013.01); H04L 9/3271 (2013.01); H04L 63/06 (2013.01); H04L 63/12 (2013.01); H04L 67/06 (2013.01); H04W 12/041 (2021.01); H04W 12/0431 (2021.01); H04W 12/35 (2021.01); G06F 16/137 (2019.01); G06F 21/31 (2013.01); G06F 21/6209 (2013.01); G06F 2211/1028 (2013.01); H04L 63/0428 (2013.01); H04L 67/1097 (2013.01); H04L 2209/043 (2013.01); H04L 2209/30 (2013.01); H04L 2209/34 (2013.01); H04L 2209/56 (2013.01); H04L 2209/80 (2013.01); H04W 12/10 (2013.01);
Abstract

A processor in a storage network operates by: receiving an access request for a data segment, wherein the data segment is encoded utilizing an error correcting information dispersal algorithm as a set of encoded data slices that are stored in a plurality of storage units of the storage network and wherein each encoded data slice of the set of encoded data slices includes a corresponding checksum of a plurality of checksums; retrieving, from the storage network, a subset of encoded data slices that includes a threshold number of encoded data slices of the set of encoded data slices; determining, based on ones of the plurality of checksums corresponding to the subset of encoded data slices, when the subset of encoded data slices includes at least one corrupted encoded data slice; retrieving from at least one of the plurality of storage units an addition number of encoded data slices required to generate a reconstructed data segment based on the subset of encoded data slices; generating the reconstructed data segment in accordance with the error correcting information dispersal algorithm, using the additional number of encoded data slices and at least some of the subset of encoded data slices; providing the reconstructed data segment in response to the access request; forming a reconstructed set of encoded data slices utilizing the error correcting information dispersal algorithm on the reconstructed data segment; and replacing the at least one corrupted encoded data slice with at least one reconstructed encoded data slice of the reconstructed set of encoded data slices.


Find Patent Forward Citations

Loading…