IP Library Granted Patent US 12,443,483
Granted Patent B2
US 12,443,483 · App. 18/638,996 · Granted Oct 14, 2025

Dispersed rebuilding of encoded data slices in a storage network

Inventors: Andrew D. Baptist (Mt. Pleasant, WI); Ravi V. Khadiwala (Bartlett, IL); Anthony J. Baldocchi (Glen Ellyn, IL); Jason K. Resch (Warwick, RI)
Assignee: Pure Storage, Inc.
G06F11/1004G06F11/1076G06F11/1092G06F11/1096G06F21/602G06F21/80H04L63/0457H04L63/061H04L63/062H04L67/1097H04L69/14G06F11/2094G06F2211/1028G06F2221/2107H04L1/0042H04L1/0047
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,443,483
App. No.
18/638,996
Granted
Oct 14, 2025
Kind
B2
Abstract

A method includes determining rebuilding performance parameter values for a storage unit of a set of storage units, where data is dispersed storage error encoded into a plurality of sets of encoded data slices in accordance with error encoding parameters, and a set of encoded data slices are stored or are to be stored in the set of storage units. The method includes updating a rate of internal rebuilding of encoded data slices by the storage unit based on the rebuilding performance parameter values. During internally rebuilding, the method includes correcting detected storage errors for one or more first encoded data slices within the storage unit. The method includes receiving a rebuilt encoded data slice from another computing device of the storage network and when the received rebuilt encoded data slice is not included in the one or more first encoded data slices, storing the received rebuilt encoded data slice.

Claims (50)

1. A method for execution by one or more processing modules, the method comprising:

determining rebuilding performance parameter values for a storage unit of a set of storage units of a storage network, wherein data is dispersed storage error encoded into a plurality of sets of encoded data slices in accordance with error encoding parameters, and wherein a set of encoded data slices of the plurality of sets of encoded data slice are stored or are to be stored in the set of storage units;

updating a rate of internal rebuilding of encoded data slices by the storage unit based on the rebuilding performance parameter values;

during internally rebuilding the encoded data slices in accordance with the rate of internal rebuilding, correcting detected storage errors for one or more first encoded data slices within the storage unit;

receiving a rebuilt encoded data slice from another computing device of the storage network; and

when the received rebuilt encoded data slice is not included in the one or more first encoded data slices, storing the received rebuilt encoded data slice.

2. The method of claim 1 further comprises:

determining second rebuilding performance parameter values for a second storage unit of the set of storage units of a storage network;

updating a second rate of internal rebuilding of second encoded data slices by the second storage unit based on the second rebuilding performance parameter values, wherein the second rate of internal rebuilding is different than the rate of internal rebuilding; and

during internally rebuilding the second encoded data slices in accordance with the second rate of internal rebuilding, correcting detected storage errors for one or more second encoded data slices within the second storage unit.

3. The method of claim 1 , wherein the updating the rate of internal rebuilding comprises:

setting the rate to less than a result obtained by dividing a difference of a link speed minus the rate of receiving rebuilt encoded data slices by a decode threshold number of the error encoding parameters.

4. The method of claim 3 , wherein the setting the rate further comprises:

including routine input/output traffic for reads and writes of other encoded data slices in the rate of receiving rebuilt encoded data slices value.

5. The method of claim 3 , wherein the setting the rate further comprises:

determining an expected number of errors per unit of time associated with the link speed and the rate of the receiving the rebuilt encoded data slices.

6. The method of claim 1 , wherein the correcting detected storage errors for a first encoded data slice of the one or more first encoded data slices comprises:

obtaining a decode threshold number of associated encoded data slices associated with a same set of encoded data slices as the first encoded data slice from other storage units of the set of storage units;

rebuilding the first encoded data slice based on the decode threshold number of associated encoded data slices; and

storing the first encoded data slice in memory of the storage unit.

7. The method of claim 1 further comprises:

when the received rebuilt encoded data slice is included in the one or more first encoded data slices, discarding the received rebuilt encoded data slice.

8. The method of claim 1 , wherein a rebuilding performance parameter value of the rebuilding performance parameter values comprises a link speed.

9. The method of claim 1 , wherein a rebuilding performance parameter value of the rebuilding performance parameter values comprises a decode threshold number of the error encoding parameters.

10. The method of claim 1 , wherein a rebuilding performance parameter value of the rebuilding performance parameter values comprises a rate of receiving rebuilt encoded data slices.

11. A storage unit of a set of storage units of a storage network, the storage unit comprises:

memory;

an interface; and

a processing module operably coupled to the memory and the interface, wherein the processing module is operable to:

determine rebuilding performance parameter values for the storage unit, wherein data is dispersed storage error encoded into a plurality of sets of encoded data slices in accordance with error encoding parameters, and wherein a set of encoded data slices of the plurality of sets of encoded data slice are stored or are to be stored in the set of storage units;

update a rate of internal rebuilding of encoded data slices by the storage unit based on the rebuilding performance parameter values;

during internally rebuilding the encoded data slices in accordance with the rate of internal rebuilding, correct detected storage errors for one or more first encoded data slices within the storage unit;

receive, via the interface, a rebuilt encoded data slice from another computing device of the storage network; and

when the received rebuilt encoded data slice is not included in the one or more first encoded data slices, store the received rebuilt encoded data slice.

12. The storage unit of claim 11 , wherein the processing module is operable to update the rate of internal rebuilding by:

setting the rate to less than a result obtained by dividing a difference of a link speed minus the rate of receiving rebuilt encoded data slices by a decode threshold number of the error encoding parameters.

13. The storage unit of claim 12 , wherein the processing module is further operable to set the rate by:

including routine input/output traffic for reads and writes of other encoded data slices in the rate of receiving rebuilt encoded data slices value.

14. The storage unit of claim 12 , wherein the processing module is further operable to set the rate further by:

determining an expected number of errors per unit of time associated with the link speed and the rate of the receiving the rebuilt encoded data slices.

15. The storage unit of claim 11 , wherein the processing module is operable to correct detected storage errors for a first encoded data slice of the one or more first encoded data slices by:

obtaining, via the interface, a decode threshold number of associated encoded data slices associated with a same set of encoded data slices as the first encoded data slice from other storage units of the set of storage units;

rebuilding the first encoded data slice based on the decode threshold number of associated encoded data slices; and

storing the first encoded data slice in memory of the storage unit.

16. The storage unit of claim 11 , wherein the processing module is further operable to:

when the received rebuilt encoded data slice is included in the one or more first encoded data slices, discard the received rebuilt encoded data slice.

17. The storage unit of claim 11 , wherein the processing module is operable to determine a rebuilding performance parameter value of the rebuilding performance parameter values comprises a link speed.

18. The storage unit of claim 11 , wherein the processing module is operable to determine a rebuilding performance parameter value of the rebuilding performance parameter values comprises a decode threshold number of the error encoding parameters.

19. The storage unit of claim 11 , wherein the processing module is operable to determine a rebuilding performance parameter value of the rebuilding performance parameter values comprises a rate of receiving rebuilt encoded data slices.

20. The storage unit of claim 11 , wherein the processing module is operable to determine a rebuilding performance parameter value of the rebuilding performance parameter values comprises a current rate of internal rebuilding the encoded data slices.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 24, 2024
From: BAPTIST, ANDREW D.; KHADIWALA, RAVI V.; BALDOCCHI, ANTHONY J.; RESCH, JASON K.
To: PURE STORAGE, INC.
Reel/Frame 067214/0488 →
Continuity (6)
Continuation 16974367 · Oct 19, 2021
Continuation 16517747 · Jul 22, 2019
Continuation In Part 15249905 · Aug 29, 2016
Continuation 14256472 · Apr 18, 2014
Provisional Application 61828905 · May 30, 2013
Related Publication 20240264901A1 · Aug 8, 2024
References Cited (111)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [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 5890156A · Rekieta · 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 · Nikolaevich · 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 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 7080101B1 · Watson · 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 7636724B2 · de la Torre · 2009 [cited by applicant]
US 9049011B1 · Agrawal · 2015 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 2002 [cited by applicant]
US 20030005285A1 · Graunke · 2003 [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 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 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, Jr. · 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 20060047907A1 · Shiga · 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 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 20070174192A1 · Gladwin · 2007 [cited by applicant]
US 20070214285A1 · Au · 2007 [cited by applicant]
US 20070234110A1 · Soran · 2007 [cited by applicant]
US 20070283167A1 · Venters, III · 2007 [cited by applicant]
US 20080183975A1 · Foster · 2008 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100306578A1 · Thornton · 2010 [cited by applicant]
US 20110029836A1 · Dhuse · 2011 [cited by applicant]
US 20110055277A1 · Resch · 2011 [cited by applicant]
US 20110055903A1 · Leggette · 2011 [cited by applicant]
US 20110216901A1 · Kiyomoto · 2011 [cited by applicant]
US 20110225362A1 · Leggette · 2011 [cited by applicant]
US 20120166813A1 · Grube · 2012 [cited by applicant]
US 20130031407A1 · Dhuse · 2013 [cited by applicant]
US 20130198130A1 · Resch · 2013 [cited by applicant]
US 20130346809A1 · Kazi · 2013 [cited by applicant]
US 20140040417A1 · Gladwin · 2014 [cited by applicant]
US 20140115346A1 · Ekberg · 2014 [cited by applicant]
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]
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]