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:
Nov. 01, 2022

Filed:

Jun. 27, 2022
Applicant:

Pure Storage, Inc., Mountain View, CA (US);

Inventors:

Ilya Volvovski, Chicago, IL (US);

Bruno H. Cabral, Chicago, IL (US);

Manish Motwani, Chicago, IL (US);

Thomas D. Cocagne, Elk Grove Village, IL (US);

Timothy W. Markison, Mesa, AZ (US);

Gary W. Grube, Barrington Hills, IL (US);

Wesley B. Leggette, Chicago, IL (US);

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

Michael C. Storm, Palo Alto, CA (US);

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

Yogesh R. Vedpathak, Chicago, IL (US);

Ravi V. Khadiwala, Bartlett, IL (US);

Assignee:

PURE STORAGE, INC., Mountain View, CA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/10 (2006.01); G06F 3/06 (2006.01); G06F 16/00 (2019.01); H04L 67/1097 (2022.01); G06F 11/07 (2006.01); H04L 67/62 (2022.01); H04L 47/72 (2022.01); G06F 9/50 (2006.01); H04L 47/28 (2022.01);
U.S. Cl.
CPC ...
G06F 11/1076 (2013.01); G06F 3/061 (2013.01); G06F 3/067 (2013.01); G06F 3/0635 (2013.01); G06F 3/0659 (2013.01); G06F 11/0709 (2013.01); G06F 11/0727 (2013.01); G06F 11/0775 (2013.01); G06F 16/00 (2019.01); H04L 47/72 (2013.01); H04L 67/1097 (2013.01); H04L 67/62 (2022.05); G06F 9/50 (2013.01); G06F 9/5005 (2013.01); G06F 9/5077 (2013.01); G06F 2211/1004 (2013.01); G06F 2211/1028 (2013.01); H04L 47/28 (2013.01);
Abstract

A network storage system operates by: sending, to at least one storage unit of a storage network, at least one read request corresponding to at least a read threshold number of a set of encoded data slices to be retrieved, wherein the set of encoded data slices correspond to a data segment, wherein the data segment is codable in accordance with dispersed error coding parameters that include a write threshold number and the read threshold number, wherein the write threshold number is a number of encoded data slices in the set of encoded data slices and wherein the read threshold number is a number of the set of slices that is required to decode the data segment; receiving from the at least one storage unit, a first subset of encoded data slices of the set of encoded data slices, wherein the first subset of encoded data slices is missing at least one missing encoded data slice from the number of the set of slices that is required to decode the data segment and that was not received from the at least one storage unit in response to the at least one read request; generating at least one rebuilt encoded data slice corresponding to the at least one missing encoded data slice utilizing locally decodable redundancy data, wherein the locally decodable redundancy data includes a plurality of local redundancy slices generated from a second subset of the set of encoded data slices that includes the at least one missing encoded data slice; and recovering the data segment based on the at least one rebuilt encoded data slice and the first subset of encoded data slices.


Find Patent Forward Citations

Loading…