IP Library Granted Patent US 12,277,030
Granted Patent B2
US 12,277,030 · App. 18/177,492 · Granted Apr 15, 2025

Rebuilding data slices in a storage network based on priority

Inventors: Greg Dhuse (Chicago, IL); Andrew Baptist (Mt. Pleasant, WI); Zachary J. Mark (Chicago, IL); Jason K. Resch (Warwick, RI); Ilya Volvovski (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F11/1092G06F11/1076G06F11/2056H04L67/1097H04L69/40G06F2211/1028G06F2211/104
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,277,030
App. No.
18/177,492
Granted
Apr 15, 2025
Kind
B2
Abstract

A distributed storage integrity system in a dispersed storage network includes a scanning agent and a control unit. The scanning agent identifies an encoded data slice that requires rebuilding, wherein the encoded data slice is one of a plurality of encoded data slices generated from a data segment using an error encoding dispersal function. The control unit retrieves at least a number T of encoded data slices needed to reconstruct the data segment based on the error encoding dispersal function. The control unit is operable to reconstruct the data segment from at least the number T of the encoded data slices and generate a rebuilt encoded data slice from the reconstructed data segment. The scanning agent is located in a storage unit and the control unit is located in the storage unit or in a storage integrity processing unit, a dispersed storage processing unit or a dispersed storage managing unit.

Claims (42)

1. A storage network comprises:

a memory that stores indicators of data slices for rebuilding; and

at least one rebuild module utilizing processing hardware operable to:

select one of the data slices for rebuilding based on a priority associated with the one of the data slices, wherein the one of the data slices is one of a plurality of encoded data slices of an encoded data segment;

generate a reconstructed data segment by reconstructing the encoded data segment from at least a threshold number of the plurality of encoded data slices; and

generate, from the reconstructed data segment, a rebuilt encoded data slice corresponding to the one of the data slices.

2. The storage network of claim 1 , further comprising:

a network interface for interfacing with a plurality of storage units in the storage network;

at least one scanning agent operable to: and

scan an address range of encoded data slices stored in the plurality of storage units that includes the plurality of encoded data slices; and

select the one of the data slices for rebuilding further based on the one of the data slices having an address within the address range.

3. The storage network of claim 2 , wherein the address range of encoded data slices corresponds to a portion of a virtual storage network addressing space.

4. The storage network of claim 3 , wherein the portion of the virtual storage network addressing space is a portion of a user vault, wherein the user vault includes a virtual storage network address space associated with a user device.

5. The storage network of claim 3 , wherein the portion of the virtual storage network addressing space corresponds to a portion of at least one pillar of a user vault, wherein the user vault includes a virtual storage network address space associated with a user device and wherein a number of pillars of the user vault equals the number of the plurality of encoded data slices of the encoded data segment for the user vault set in accordance data storage parameters and an error coding scheme.

6. The storage network of claim 1 , wherein the at least one rebuild module is further operable to:

determine the indicators of data slices for rebuilding, wherein the indicators each include a vault identifier that identifies a user vault from a physical address table.

7. The storage network of claim 1 , wherein the encoded data segment is one of a plurality of encoded data segments of a data object and wherein the priority is associated with the data object.

8. The storage network of claim 7 , wherein the priority associated with the data object includes at least one of: a priority indicator for the data object, a priority indicator of a user associated with the data object, a priority indicator for a data object type, or a priority indicator based on a data slice age.

9. The storage network of claim 1 , wherein the threshold number corresponds to a number of the plurality of encoded data slices needed to reconstruct the encoded data segment based on an error encoding dispersal function.

10. The storage network of claim 9 , wherein the at least one rebuild module is operable to reconstruct the encoded data segment from at least the threshold number of the plurality of encoded data slices of by:

decoding at least the threshold number of the plurality of encoded data slices in accordance with the error encoding dispersal function.

11. A storage network comprises:

a memory that stores indicators of data slices for rebuilding; and

processing hardware operable to:

select one of the data slices for rebuilding based on a priority associated with the one of the data slices, wherein the one of the data slices is one of a plurality of encoded data slices of an encoded data segment;

generate a reconstructed data segment by reconstructing the encoded data segment from at least a threshold number of the plurality of encoded data slices; and

generate, from the reconstructed data segment, a rebuilt encoded data slice corresponding to the one of the data slices.

12. The storage network of claim 11 , further comprising:

a network interface for interfacing with a plurality of storage units in the storage network; and

at least one scanning agent operable to:

scan an address range of encoded data slices stored in the plurality of storage units that includes the plurality of encoded data slices; and

select the one of the data slices for rebuilding further based on the one of the data slices having an address within the address range.

13. The storage network of claim 12 , wherein the address range of encoded data slices corresponds to a portion of a virtual storage network addressing space.

14. The storage network of claim 13 , wherein the portion of the virtual storage network addressing space is a portion of a user vault, wherein the user vault includes a virtual storage network address space associated with a user device.

15. The storage network of claim 13 , wherein the portion of the virtual storage network addressing space corresponds to a portion of at least one pillar of a user vault, wherein the user vault includes a virtual storage network address space associated with a user device and wherein a number of pillars of the user vault equals the number of the plurality of encoded data slices of the encoded data segment for the user vault set in accordance data storage parameters and an error coding scheme.

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

determine the indicators of data slices for rebuilding, wherein the indicators each include a vault identifier that identifies a user vault from a physical address table.

17. The storage network of claim 11 , wherein the encoded data segment is one of a plurality of encoded data segments of a data object and wherein the priority is associated with the data object.

18. The storage network of claim 17 , wherein the priority associated with the data object includes at least one of: a priority indicator for the data object, a priority indicator of a user associated with the data object, a priority indicator for a data object type, or a priority indicator based on a data slice age.

19. The storage network of claim 11 , wherein the threshold number corresponds to a number of the plurality of encoded data slices needed to reconstruct the encoded data segment based on an error encoding dispersal function.

20. The storage network of claim 19 , wherein the processing hardware is operable to reconstruct the encoded data segment from at least the threshold number of the plurality of encoded data slices of by:

decoding at least the threshold number of the plurality of encoded data slices in accordance with the error encoding dispersal function.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 6, 2023
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 063208/0789 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 3, 2023
From: CLEVERSAFE, INC.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 062943/0863 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 2, 2023
From: DHUSE, GREG; BAPTIST, ANDREW; MARK, ZACHARY J.; RESCH, JASON K.; VOLVOVSKI, ILYA
To: CLEVERSAFE, INC.
Reel/Frame 062861/0989 →
Continuity (16)
Continuation 17457794 · Dec 6, 2021
Continuation 16535545 · Aug 8, 2019
Continuation 15612243 · Jun 2, 2017
Continuation 14331997 · Jul 15, 2014
Continuation 14047661 · Oct 7, 2013
Continuation 13863475 · Apr 16, 2013
Continuation 12797025 · Jun 9, 2010
Continuation 12767364 · Apr 26, 2010
Continuation In Part 12716106 · Mar 2, 2010
Continuation In Part 12080042 · Mar 31, 2008
Continuation In Part 11973542 · Oct 9, 2007
Continuation In Part 11403391 · Apr 13, 2006
Continuation In Part 11241555 · Sep 30, 2005
Provisional Application 61230038 · Jul 30, 2009
Provisional Application 61230034 · Jul 30, 2009
Related Publication 20230205635A1 · Jun 29, 2023
References Cited (174)
US 4092732A · Ouchi · 1978 [cited by applicant]
US 5454101A · Mackay · 1995 [cited by applicant]
US 5485474A · Rabin · 1996 [cited by applicant]
US 5680539A · Jones · 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 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 6092215A · Hodges et al. · 2000 [cited by applicant]
US 6128277A · Bruck · 2000 [cited by applicant]
US 6175571B1 · Haddock · 2001 [cited by applicant]
US 6189123B1 · Anders Nystrom · 2001 [cited by examiner]
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 6446237B1 · Menon · 2002 [cited by applicant]
US 6449688B1 · Peters · 2002 [cited by applicant]
US 6516425B1 · Belhadj · 2003 [cited by applicant]
US 6567948B2 · Steele · 2003 [cited by applicant]
US 6571282B1 · Bowman-Amuah · 2003 [cited by applicant]
US 6571351B1 · Mitaru · 2003 [cited by applicant]
US 6609223B1 · Wolfgang · 2003 [cited by applicant]
US 6647514B1 · Umberger et al. · 2003 [cited by applicant]
US 6675318B1 · Lee · 2004 [cited by applicant]
US 6718361B1 · Basani · 2004 [cited by applicant]
US 6738942B1 · Sridharan · 2004 [cited by examiner]
US 6742081B2 · Talagala · 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 6842422B1 · Bianchini, Jr. · 2005 [cited by applicant]
US 6879596B1 · Dooply · 2005 [cited by applicant]
US 6895469B2 · Tomita · 2005 [cited by applicant]
US 6912614B2 · Tomita · 2005 [cited by applicant]
US 6959413B2 · Humlicek et al. · 2005 [cited by applicant]
US 6981171B2 · Hashemi · 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 7146461B1 · Kiselev et al. · 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 7308599B2 · Patterson · 2007 [cited by applicant]
US 7546427B2 · Gladwin et al. · 2009 [cited by applicant]
US 7636724B2 · De La Torre · 2009 [cited by applicant]
US 7810145B2 · Lehinger · 2010 [cited by applicant]
US 7953937B2 · Gladwin · 2011 [cited by applicant]
US 8001417B2 · Byrne · 2011 [cited by applicant]
US 8209363B2 · Palthepu · 2012 [cited by applicant]
US 8352782B2 · Thornton · 2013 [cited by examiner]
US 8464096B2 · Thornton · 2013 [cited by applicant]
US 8489915B2 · Dhuse et al. · 2013 [cited by applicant]
US 8538028B2 · Yeap · 2013 [cited by applicant]
US 8555109B2 · Dhuse · 2013 [cited by applicant]
US 8560882B2 · Thornton · 2013 [cited by applicant]
US 8615039B2 · Lee · 2013 [cited by applicant]
US 8706980B2 · Dhuse · 2014 [cited by applicant]
US 8819482B2 · Dhuse · 2014 [cited by applicant]
US 8972774B2 · Grube · 2015 [cited by applicant]
US 9274977B2 · Resch · 2016 [cited by applicant]
US 9785503B2 · Dhuse · 2017 [cited by applicant]
US 10108492B2 · Dhuse · 2018 [cited by applicant]
US 10387256B2 · Dhuse · 2019 [cited by applicant]
US 10802732B2 · Baptist · 2020 [cited by applicant]
US 11010357B2 · Volvovski · 2021 [cited by applicant]
US 20020062422A1 · Butterworth · 2002 [cited by applicant]
US 20020166079A1 · Ulrich · 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 20030120723A1 · Bright · 2003 [cited by applicant]
US 20030123603A1 · Suzuki · 2003 [cited by applicant]
US 20040024963A1 · Talagala · 2004 [cited by applicant]
US 20040122917A1 · Menon · 2004 [cited by applicant]
US 20040128442A1 · Hinshaw et al. · 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 20060041782A1 · Ali et al. · 2006 [cited by applicant]
US 20060047907A1 · Shiga · 2006 [cited by applicant]
US 20060136448A1 · Cialini · 2006 [cited by applicant]
US 20060156059A1 · Kitamura · 2006 [cited by examiner]
US 20060161805A1 · Tseng · 2006 [cited by applicant]
US 20060218433A1 · Williams · 2006 [cited by examiner]
US 20060224603A1 · Correll, Jr. · 2006 [cited by applicant]
US 20060233239A1 · Sethi et al. · 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 20070174682A1 · King · 2007 [cited by applicant]
US 20070205268A1 · Yamasaki · 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 20080002777A1 · Hwang et al. · 2008 [cited by applicant]
US 20080120361A1 · Pagan · 2008 [cited by applicant]
US 20080183975A1 · Foster · 2008 [cited by examiner]
US 20080250270A1 · Bennett · 2008 [cited by applicant]
US 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20090178144A1 · Redlich et al. · 2009 [cited by applicant]
US 20090182939A1 · Hluchyj · 2009 [cited by applicant]
US 20090194585A1 · Blackson · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20100031082A1 · Olster · 2010 [cited by applicant]
US 20100161916A1 · Thornton · 2010 [cited by applicant]
US 20100268877A1 · Resch · 2010 [cited by examiner]
US 20100269008A1 · Leggette · 2010 [cited by examiner]
US 20110029711A1 · Dhuse · 2011 [cited by applicant]
US 20110029809A1 · Dhuse · 2011 [cited by applicant]
US 20110029836A1 · Dhuse · 2011 [cited by examiner]
US 20110029842A1 · Grube · 2011 [cited by examiner]
US 20110078277A1 · Baptist · 2011 [cited by applicant]
US 20110126060A1 · Grube · 2011 [cited by applicant]
US 20120290873A1 · Thornton et al. · 2012 [cited by applicant]
US 20140298085A1 · Baptist · 2014 [cited by applicant]
US 20140351659A1 · Dhuse · 2014 [cited by applicant]
US 20150355979A1 · Volvovski · 2015 [cited by applicant]
US 20160253240A1 · Cocagne · 2016 [cited by applicant]
US 20160321136A1 · Baptist · 2016 [cited by applicant]
US 20170153947A1 · Baptist · 2017 [cited by applicant]
US 20170270003A1 · Dhuse · 2017 [cited by applicant]
US 20170300374A1 · Gladwin · 2017 [cited by applicant]
US 20180103106A1 · Cocagne · 2018 [cited by applicant]
US 20190068709A1 · McShane · 2019 [cited by applicant]
Chung; An Automatic Data Segmentation Method for 3D Measured Data Points; National Taiwan University; pp. 1-8; 1998. [cited by applicant]
European Patent Office; Extended European Search Report; EP 10804922; Sep. 15, 2017; 8 pgs. [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]
International Search Report and Written Opinion; International Application No. PCT/US10/43178; Nov. 4, 2010; 9 pages. [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]
Cited By (1)
US 12,339,937