IP Library Granted Patent US 12,505,016
Granted Patent B2
US 12,505,016 · App. 18/809,965 · Granted Dec 23, 2025

Recovering missing data in a storage network via locally decodable redundancy data

Inventors: Ilya Volvovski (Chicago, IL); Bruno H. Cabral (Chicago, IL); Manish Motwani (Chicago, IL); Thomas D. Cocagne (Elk Grove Village, IL); Timothy W. Markison (Mesa, AZ); Gary W. Grube (Barrington Hills, IL); Wesley B. Leggette (Chicago, IL); Jason K. Resch (Warwick, RI); Michael C. Storm (Palo Alto, CA); Greg R. Dhuse (Chicago, IL); Yogesh R. Vedpathak (Chicago, IL); Ravi V. Khadiwala (Bartlett, IL)
Assignee: Pure Storage, Inc.
G06F11/1076G06F3/061G06F3/0635G06F3/0659G06F3/067G06F11/0709G06F11/0727G06F11/0775G06F16/00H04L47/72H04L67/1097H04L67/62G06F9/50G06F9/5005G06F9/5077G06F2211/1004G06F2211/1028H04L47/28
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,016
App. No.
18/809,965
Granted
Dec 23, 2025
Kind
B2
Abstract

A processing system of a storage network operates by: sending, to at least one storage unit of the 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 data, wherein the data is coded 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 encoded data slices that is required to decode the data; receiving, at the at least one processing circuit and from the at least one storage unit, a first subset of the set of encoded data slices, wherein at least one missing encoded data slice was not included in the first subset and wherein a number of encoded data slices in the first subset is less than the read threshold number; generating, via the at least one processing circuit, 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 corresponds to a second subset of the set of encoded data slices that includes the at least one missing encoded data slice and wherein the locally decodable redundancy data is stored locally to the processing circuit; and recovering, via the at least one processing circuit, the data based on the at least one rebuilt encoded data slice and the first subset.

Claims (41)

1 . A method for execution by at least one processing circuit of a storage network, the method comprises:

sending, to at least one storage unit of the 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 data that is coded 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 encoded data slices that is required to decode the data;

receiving, at the at least one processing circuit and from the at least one storage unit, a first subset of the set of encoded data slices, wherein at least one missing encoded data slice was not included in the first subset and wherein a number of encoded data slices in the first subset is less than the read threshold number,

generating, via the at least one processing circuit, 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 corresponds to a second subset of the set of encoded data slices that includes the at least one missing encoded data slice and wherein the locally decodable redundancy data is stored locally to the processing circuit; and

recovering, via the at least one processing circuit, the data based on the at least one rebuilt encoded data slice and the first subset.

2 . The method of claim 1 , further comprising:

identifying, via the at least one processing circuit, the at least one missing encoded data slice of the first subset.

3 . The method of claim 2 , wherein the at least one missing encoded data slice of the first subset is identified when the at least one missing encoded data slice was not received from the at least one storage unit in response to the at least one read request.

4 . The method of claim 1 , wherein the second subset of the set of encoded data slices includes less than the read threshold number of the set of encoded data slices.

5 . The method of claim 1 , wherein the at least one missing encoded data slice corresponds to failure of an individual storage device of the at least one storage unit.

6 . The method of claim 5 , wherein the individual storage device is a drive that failed.

7 . The method of claim 1 , further comprising:

selecting the second subset of the set of encoded data slices to generate the locally decodable redundancy data.

8 . A storage network system of a storage network comprises:

at least one processing circuit;

a memory that stores operational instructions, that when executed by the at least one processing circuit cause the storage processing system to perform operations that include:

sending, to at least one storage unit of the 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 data that is coded 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 encoded data slices that is required to decode the data;

receiving, at the at least one processing circuit and from the at least one storage unit, a first subset of the set of encoded data slices, wherein at least one missing encoded data slice was not included in the first subset and wherein a number of encoded data slices in the first subset is less than the read threshold number;

generating, via the at least one processing circuit, 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 corresponds to a second subset of the set of encoded data slices that includes the at least one missing encoded data slice and wherein the locally decodable redundancy data is stored locally to the processing circuit; and

recovering, via the at least one processing circuit, the data based on the at least one rebuilt encoded data slice and the first subset.

9 . The storage network system of claim 8 , wherein the operations further include:

identifying, via the at least one processing circuit, the at least one missing encoded data slice of the first subset.

10 . The storage network system of claim 9 , wherein the at least one missing encoded data slice of the first subset is identified when the at least one missing encoded data slice was not received from the at least one storage unit in response to the at least one read request.

11 . The storage network system of claim 8 , wherein the second subset of the set of encoded data slices includes less than the read threshold number of the set of encoded data slices.

12 . The storage network system of claim 8 , wherein the at least one missing encoded data slice corresponds to failure of an individual storage device of the at least one storage unit.

13 . The storage network system of claim 12 , wherein the individual storage device is a drive that failed.

14 . The storage network system of claim 8 , wherein the operations further include:

selecting the second subset of the set of encoded data slices to generate the locally decodable redundancy data.

15 . A non-transitory computer readable storage medium comprises:

at least one memory that stores operational instructions that, when executed by a storage network that includes at least one processing circuit and a memory, causes the storage network to perform operations that include:

sending, to at least one storage unit of the 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 data that is coded 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 encoded data slices that is required to decode the data;

receiving, at the at least one processing circuit and from the at least one storage unit, a first subset of the set of encoded data slices, wherein at least one missing encoded data slice was not included in the first subset and wherein a number of encoded data slices in the first subset is less than the read threshold number;

generating, via the at least one processing circuit, 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 corresponds to a second subset of the set of encoded data slices that includes the at least one missing encoded data slice and wherein the locally decodable redundancy data is stored locally to the processing circuit; and

recovering, via the at least one processing circuit, the data based on the at least one rebuilt encoded data slice and the first subset.

16 . The non-transitory computer readable storage medium of claim 15 , wherein the operations further include:

identifying, via the at least one processing circuit, the at least one missing encoded data slice of the first subset.

17 . The non-transitory computer readable storage medium of claim 16 , wherein the at least one missing encoded data slice of the first subset is identified when the at least one missing encoded data slice was not received from the at least one storage unit in response to the at least one read request.

18 . The non-transitory computer readable storage medium of claim 16 , wherein the second subset of the set of encoded data slices includes less than the read threshold number of the set of encoded data slices.

19 . The non-transitory computer readable storage medium of claim 15 , wherein the at least one missing encoded data slice corresponds to failure of an individual storage drive of the at least one storage unit.

20 . The non-transitory computer readable storage medium of claim 15 , wherein the operations further include:

selecting the second subset of the set of encoded data slices to generate the locally decodable redundancy data.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 23, 2024
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 068761/0565 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 22, 2024
From: CLEVERSAFE, INC.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 068747/0346 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2024
From: VOLVOVSKI, ILYA; CABRAL, BRUNO H.; MOTWANI, MANISH; COCAGNE, THOMAS D.; MARKISON, TIMOTHY W.; GRUBE, GARY W.; LEGGETTE, WESLEY B.; RESCH, JASON K.; DHUSE, GREG R.; VEDPATHAK, YOGESH R.; KHADIWALA, RAVI V.
To: PURE STORAGE, INC.
Reel/Frame 068354/0015 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 21, 2024
From: STORM, MICHAEL C.
To: CLEVERSAFE, INC.
Reel/Frame 068354/0299 →
Continuity (17)
Continuation 18175143 · Feb 27, 2023
Continuation 17933563 · Sep 20, 2022
Continuation 17850145 · Jun 27, 2022
Continuation 17084828 · Oct 30, 2020
Continuation In Part 16854010 · Apr 21, 2020
Continuation 16108905 · Aug 22, 2018
Continuation In Part 15400767 · Jan 6, 2017
Continuation 14680459 · Apr 7, 2015
Continuation In Part 16366715 · Mar 27, 2019
Continuation 15362460 · Nov 28, 2016
Continuation In Part 13270528 · Oct 11, 2011
Continuation In Part 12983232 · Dec 31, 2010
Provisional Application 62008207 · Jun 5, 2014
Provisional Application 61408980 · Nov 1, 2010
Provisional Application 61308938 · Feb 27, 2010
Provisional Application 61314166 · Mar 16, 2010
Related Publication 20240411643A1 · Dec 12, 2024
References Cited (156)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5278838A · Ng et al. · 1994 [cited by applicant]
US 5398253A · Gordon · 1995 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5459853A · Best · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5504858A · Ellis · 1996 [cited by applicant]
US 5579475A · Blaum · 1996 [cited by applicant]
US 5623595A · Bailey · 1997 [cited by applicant]
US 5774643A · Lubbers · 1998 [cited by applicant]
US 5802364A · Senator · 1998 [cited by applicant]
US 5809285A · Hilland · 1998 [cited by applicant]
US 5835940A · Yorimitsu · 1998 [cited by examiner]
US 5890156A · Rekieta · 1999 [cited by applicant]
US 5909540A · Carter · 1999 [cited by applicant]
US 5987622A · Lo Verso · 1999 [cited by applicant]
US 5991414A · Garay · 1999 [cited by applicant]
US 6012159A · Fischer · 2000 [cited by applicant]
US 6058454A · Gerlach · 2000 [cited by applicant]
US 6128277A · Bruck · 2000 [cited by applicant]
US 6175571B1 · Haddock · 2001 [cited by applicant]
US 6192472B1 · Garay · 2001 [cited by applicant]
US 6256688B1 · Suetaka · 2001 [cited by applicant]
US 6272658B1 · Steele · 2001 [cited by applicant]
US 6301604B1 · Nojima · 2001 [cited by applicant]
US 6356949B1 · Katsandres · 2002 [cited by applicant]
US 6366995B1 · Vilkov · 2002 [cited by applicant]
US 6374336B1 · Peters · 2002 [cited by applicant]
US 6415373B1 · Peters · 2002 [cited by applicant]
US 6418539B1 · Walker · 2002 [cited by applicant]
US 6449688B1 · Peters · 2002 [cited by applicant]
US 6480970B1 · DeKoning · 2002 [cited by applicant]
US 6536949B1 · Heuser · 2003 [cited by applicant]
US 6567948B2 · Steele · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6718361B1 · Basani · 2004 [cited by applicant]
US 6760808B2 · Peters · 2004 [cited by applicant]
US 6785768B2 · Peters · 2004 [cited by applicant]
US 6785783B2 · Buckland · 2004 [cited by applicant]
US 6826711B2 · Moulton · 2004 [cited by applicant]
US 6879596B1 · Dooply · 2005 [cited by applicant]
US 7003688B1 · Pittelkow · 2006 [cited by applicant]
US 7024451B2 · Jorgenson · 2006 [cited by applicant]
US 7024609B2 · Wolfgang · 2006 [cited by applicant]
US 7073115B2 · English · 2006 [cited by applicant]
US 7080101B1 · Watson · 2006 [cited by applicant]
US 7080278B1 · Kleiman · 2006 [cited by applicant]
US 7103824B2 · Halford · 2006 [cited by applicant]
US 7103915B2 · Redlich · 2006 [cited by applicant]
US 7111115B2 · Peters · 2006 [cited by applicant]
US 7140044B2 · Redlich · 2006 [cited by applicant]
US 7146644B2 · Redlich · 2006 [cited by applicant]
US 7171493B2 · Shu · 2007 [cited by applicant]
US 7222133B1 · Raipurkar · 2007 [cited by applicant]
US 7240236B2 · Cutts · 2007 [cited by applicant]
US 7272613B2 · Sim · 2007 [cited by applicant]
US 7454566B1 · Overby · 2008 [cited by applicant]
US 7636724B2 · De La Torre · 2009 [cited by applicant]
US 8014418B2 · Shankara · 2011 [cited by applicant]
US 8250257B1 · Harel et al. · 2012 [cited by applicant]
US 8301853B1 · Madnani · 2012 [cited by applicant]
US 8589625B2 · Colgrove · 2013 [cited by applicant]
US 8782211B1 · Sharma · 2014 [cited by applicant]
US 8880799B2 · Foster · 2014 [cited by applicant]
US 10326610B2 · Ireland · 2019 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020161972A1 · Talagala · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20020178325A1 · Allingham · 2002 [cited by examiner]
US 20020194526A1 · Ulrich et al. · 2002 [cited by applicant]
US 20030018927A1 · Gadir · 2003 [cited by applicant]
US 20030037261A1 · Meffert · 2003 [cited by applicant]
US 20030065617A1 · Watkins · 2003 [cited by applicant]
US 20030084020A1 · Shu · 2003 [cited by applicant]
US 20030126244A1 · Smith · 2003 [cited by applicant]
US 20030161316A1 · Kramer · 2003 [cited by applicant]
US 20030182502A1 · Kleiman · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040153567A1 · Lichtenstein · 2004 [cited by applicant]
US 20040215998A1 · Buxton · 2004 [cited by applicant]
US 20040228493A1 · Ma · 2004 [cited by applicant]
US 20050100022A1 · Ramprashad · 2005 [cited by applicant]
US 20050114594A1 · Corbett · 2005 [cited by applicant]
US 20050125593A1 · Karpoff · 2005 [cited by applicant]
US 20050131993A1 · Fatula · 2005 [cited by applicant]
US 20050132070A1 · Redlich · 2005 [cited by applicant]
US 20050144382A1 · Schmisseur · 2005 [cited by applicant]
US 20050229069A1 · Hassner · 2005 [cited by applicant]
US 20050240792A1 · Sicola · 2005 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060080505A1 · Arai · 2006 [cited by applicant]
US 20060129771A1 · Dasgupta · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by applicant]
US 20060224603A1 · Correll, Jr. · 2006 [cited by applicant]
US 20060265436A1 · Edmond · 2006 [cited by applicant]
US 20070079081A1 · Gladwin · 2007 [cited by applicant]
US 20070079082A1 · Gladwin · 2007 [cited by applicant]
US 20070079083A1 · Gladwin · 2007 [cited by applicant]
US 20070088970A1 · Buxton · 2007 [cited by applicant]
US 20070143762A1 · Arnold · 2007 [cited by applicant]
US 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070186143A1 · Gubbi · 2007 [cited by applicant]
US 20070208760A1 · Reuter · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070220405A1 · Arnold · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters, III · 2007 [cited by applicant]
US 20080126912A1 · Zohar · 2008 [cited by applicant]
US 20080183975A1 · Foster · 2008 [cited by examiner]
US 20090037656A1 · Suetsugu · 2009 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20090216986A1 · Sakurai · 2009 [cited by applicant]
US 20100005237A1 · Bougaev · 2010 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100023525A1 · Westerlund · 2010 [cited by applicant]
US 20100268692A1 · Resch · 2010 [cited by applicant]
US 20100306578A1 · Thornton · 2010 [cited by applicant]
US 20110029711A1 · Dhuse · 2011 [cited by applicant]
US 20110055170A1 · Mark · 2011 [cited by applicant]
US 20110106909A1 · Gladwin · 2011 [cited by applicant]
US 20110107113A1 · Resch et al. · 2011 [cited by applicant]
US 20110113282A1 · De Spiegeleer · 2011 [cited by examiner]
US 20110167221A1 · Pangal · 2011 [cited by examiner]
US 20110202732A1 · Montgomery · 2011 [cited by applicant]
US 20110213928A1 · Grube · 2011 [cited by applicant]
US 20110289577A1 · Resch · 2011 [cited by applicant]
US 20120054500A1 · Dhuse · 2012 [cited by applicant]
US 20130191843A1 · Sarkar · 2013 [cited by applicant]
US 20130304711A1 · Resch · 2013 [cited by applicant]
US 20140278496A1 · Spencer · 2014 [cited by applicant]
US 20150200833A1 · Cutforth et al. · 2015 [cited by applicant]
US 20160179618A1 · Resch · 2016 [cited by applicant]
US 20230081087A1 · Cocagne · 2023 [cited by examiner]
Chung; An Automatic Data Segmentation Method for 3D Measured Data Points; National Taiwan University; pp. 1-8; 1998. [cited by applicant]
Harrison; Lightweight Directory Access Protocol (LDAP): Authentication Methods and Security Mechanisms; IETF Network Working Group; RFC 4513; Jun. 2006; pp. 1-32. [cited by applicant]
Kubiatowicz, et al.; OceanStore: An Architecture for Global-Scale Persistent Storage; Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 20… [cited by applicant]
Legg; Lightweight Directory Access Protocol (LDAP): Syntaxes and Matching Rules; IETF Network Working Group; RFC 4517; Jun. 2006; pp. 1-50. [cited by applicant]
Plank, T1: Erasure Codes for Storage Applications; FAST2005, 4th USENIX Conference on File Storage Technologies; Dec. 13-16, 2005; pp. 1-74. [cited by applicant]
Rabin; Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance; Journal of the Association for Computer Machinery; vol. 36, No. 2; Apr. 1989; pp. 335-348. [cited by applicant]
Satran, et al.; Internet Small Computer Systems Interface (ISCSI); IETF Network Working Group; RFC 3720; Apr. 2004; pp. 1-257. [cited by applicant]
Sciberras; Lightweight Directory Access Protocol (LDAP): Schema for User Applications; IETF Network Working Group; RFC 4519; Jun. 2006; pp. 1-33. [cited by applicant]
Sermersheim; Lightweight Directory Access Protocol (LDAP): The Protocol; IETF Network Working Group; RFC 4511; Jun. 2006; pp. 1-68. [cited by applicant]
Shamir; How to Share a Secret; Communications of the ACM; vol. 22, No. 11; Nov. 1979; pp. 612-613. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): Uniform Resource Locator; IETF Network Working Group; RFC 4516; Jun. 2006; pp. 1-15. [cited by applicant]
Smith; Lightweight Directory Access Protocol (LDAP): String Representation of Search Filters; IETF Network Working Group; RFC 4515; Jun. 2006; pp. 1-12. [cited by applicant]
Wikipedia's Flash Memory; historical version published Feb. 21, 2010; https://en.wikipedia.org/w/index.php?title=Flash_memory&oldid=345476392 (Year: 2010). [cited by applicant]
Wildi; Java iSCSi Initiator; Master Thesis; Department of Computer and Information Science, University of Konstanz; Feb. 2007; 60 pgs. [cited by applicant]
Xin, et al.; Evaluation of Distributed Recovery in Large-Scale Storage Systems; 13th IEEE International Symposium on High Performance Distributed Computing; Jun. 2004; pp. 172-181. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Directory Information Models; IETF Network Working Group; RFC 4512; Jun. 2006; pp. 1-49. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Internationalized String Preparation; IETF Network Working Group; RFC 4518; Jun. 2006; pp. 1-14. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): String Representation of Distinguished Names; IETF Network Working Group; RFC 4514; Jun. 2006; pp. 1-15. [cited by applicant]
Zeilenga; Lightweight Directory Access Protocol (LDAP): Technical Specification Road Map; IETF Network Working Group; RFC 4510; Jun. 2006; pp. 1-8. [cited by applicant]