IP Library Granted Patent US 12,223,194
Granted Patent B2
US 12,223,194 · App. 18/519,681 · Granted Feb 11, 2025

Re-encoding data in a storage network based on addition of additional storage units

Inventors: Ethan S. Wozniak (Park Ridge, IL); Andrew D. Baptist (Mt. Pleasant, WI); Greg R. Dhuse (Chicago, IL); Ilya Volvovski (Chicago, IL); Jason K. Resch (Warwick, RI); Ravi V. Khadiwala (Bartlett, IL); Wesley B. Leggette (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F3/0644G06F3/0619G06F3/0631G06F3/0659G06F3/067G06F3/0688
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,223,194
App. No.
18/519,681
Granted
Feb 11, 2025
Kind
B2
Abstract

A processing system is operable to encode data to produce a first set of data slices based on a value of a width parameter. The data is stored based on maintaining storage of the first set of data slices across a set of storage units of a storage pool. Storage of the first set of data slices is maintained in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool. The value of the width parameter is increased to an increased value to produce an updated width parameter. The data is re-encoded in accordance with the updated width parameter to produce a second set of data slices. The data is re-stored based on maintaining storage of the second set of data slices across the expanded set of storage units of the storage pool.

Claims (47)

1. A method comprises:

encoding data in accordance with a width parameter to produce a first set of data slices that includes a first number of data slices based on a value of the width parameter;

storing the data based on maintaining storage of the first set of data slices in a first plurality of selected locations across a set of storage units of a storage pool;

maintaining storage of the first set of data slices in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool;

increasing the value of the width parameter to an increased value, based on an expanded set of storage units of the storage pool that includes the additional set of storage units added to the storage pool, to produce an updated width parameter;

re-encoding the data in accordance with the updated width parameter to produce a second set of data slices that includes a second number of data slices based on the increased value of the updated width parameter, wherein the second number of data slices is strictly greater than the first number of data slices based on the increased value of the updated width parameter being strictly greater than the value of the width parameter; and

re-storing the data based on maintaining storage of the second set of data slices in a second plurality of selected locations across the expanded set of storage units of the storage pool, wherein the second plurality of selected locations includes a greater number of locations than the first plurality of selected locations based on the second number of data slices being strictly greater than the first number of data slices.

2. The method of claim 1 , further comprising:

retrieving the first set of data slices from storage in the set of storage units based on applying identifiers of the first set of data slices; and

generating recovered data based on performing a decoding function upon the first set of data slices retrieved from storage to recover the data;

wherein the data is re-encoded based on performing an encoding function upon the recovered data by utilizing the updated width parameter.

3. The method of claim 1 , wherein maintaining storage of the second set of data slices in the expanded set of storage units includes rebuilding at least one data slice associated with at least one storage error.

4. The method of claim 1 , wherein the set of storage units are implemented as a set of solid state memory devices.

5. The method of claim 1 , further comprising:

deleting at least one data slice of the first set of data slices from storage in the set of storage units.

6. The method of claim 5 , wherein deleting the at least one data slice of the first set of data slices from the set of storage units is based on a maintained number of data slices stored in the set of storage units.

7. The method of claim 1 , further comprising:

receiving identifiers for the additional set of storage units added to the storage pool, wherein activation of the set of storage units is detected based on receiving the identifiers for the additional set of storage units added to the storage pool.

8. The method of claim 1 , wherein the data is encoded in accordance with an encoding function, and wherein a decoding function corresponding to the encoding function can accommodate a number of failures equal to the width parameter minus an error coding parameter utilized to encode the data.

9. The method of claim 1 , wherein the first number of data slices is equal to the width parameter, and wherein the second number of data slices is equal to the updated width parameter.

10. The method of claim 1 , wherein the updated width parameter is determined based on a number of storage units included in the expanded set of storage units.

11. A processing system of a computing device comprises:

at least one processor;

a memory that stores operational instructions that, when executed by the at least one processor, cause the processing system to:

encode data in accordance with a width parameter to produce a first set of data slices that includes a first number of data slices based on a value of the width parameter;

store the data based on maintaining storage of the first set of data slices in a first plurality of selected locations across a set of storage units of a storage pool;

maintain storage of the first set of data slices in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool;

increase the value of the width parameter to an increased value, based on an expanded set of storage units of the storage pool that includes the additional set of storage units added to the storage pool, to produce an updated width parameter;

re-encode the data in accordance with the updated width parameter to produce a second set of data slices that includes a second number of data slices based on the increased value of the updated width parameter, wherein the second number of data slices is strictly greater than the first number of data slices based on the increased value of the updated width parameter being strictly greater than the value of the width parameter; and

re-store the data based on maintaining storage of the second set of data slices in a second plurality of selected locations across the expanded set of storage units of the storage pool, wherein the second plurality of selected locations includes a greater number of locations than the first plurality of selected locations based on the second number of data slices being strictly greater than the first number of data slices.

12. The processing system of claim 11 , wherein maintaining storage of the second set of data slices in the expanded set of storage units includes rebuilding at least one data slice associated with at least one storage error.

13. The processing system of claim 11 , wherein the set of storage units are implemented as a set of solid state memory devices.

14. The processing system of claim 11 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to:

delete at least one data slice of the first set of data slices from the set of storage units.

15. The processing system of claim 14 , wherein deleting the at least one data slice of the first set of data slices from the set of storage units is based on a maintained number of data slices stored in the set of storage units.

16. The processing system of claim 11 , wherein the second set of data slices includes a greater number of data slices than the first set of data slices based on the updated width parameter being increased from the width parameter.

17. The processing system of claim 11 , wherein the data is encoded in accordance with an encoding function, and wherein a decoding function corresponding to the encoding function can accommodate a number of failures equal to the width parameter minus an error coding parameter utilized to encode the data.

18. The processing system of claim 11 , wherein the first set of data slices includes a number of data slices equal to the width parameter.

19. The processing system of claim 11 , wherein the updated width parameter is determined based on a number of storage units included in the expanded set of storage units.

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

at least one memory section that stores operational instructions that, when executed by a processing system of a storage network that includes a processor and a memory, causes the processing system to:

encode data in accordance with a width parameter to produce a first set of data slices that includes a first number of data slices based on a value of the width parameter;

store the data based on maintaining storage of the first set of data slices in a first plurality of different locations across a set of storage units of a storage pool;

maintain storage of the first set of data slices in the set of storage units of the storage pool after addition of an additional set of storage units added to the storage pool;

increase the value of the width parameter to an increased value, based on an expanded set of storage units of the storage pool that includes the additional set of storage units added to the storage pool, to produce an updated width parameter;

re-encode the data in accordance with the updated width parameter to produce a second set of data slices that includes a second number of data slices based on the increased value of the updated width parameter, wherein the second number of data slices is strictly greater than the first number of data slices based on the increased value of the updated width parameter being strictly greater than the value of the width parameter; and

re-store the data based on maintaining storage of the second set of data slices in a second plurality of different locations across the expanded set of storage units of the storage pool, wherein the second plurality of different locations includes a greater number of locations than the first plurality of different locations based on the second number of data slices being strictly greater than the first number of data slices.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 28, 2023
From: WOZNIAK, ETHAN S.; BAPTIST, ANDREW D.; DHUSE, GREG R.; VOLVOVSKI, ILYA; RESCH, JASON K.; KHADIWALA, RAVI V.; LEGGETTE, WESLEY B.
To: PURE STORAGE, INC.
Reel/Frame 065677/0282 →
Continuity (6)
Continuation 17136128 · Dec 29, 2020
Continuation In Part 15838983 · Dec 12, 2017
Continuation In Part 15818633 · Nov 20, 2017
Continuation In Part 14984024 · Dec 30, 2015
Provisional Application 62121736 · Feb 27, 2015
Related Publication 20240094934A1 · Mar 21, 2024
References Cited (121)
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 9086964B2 · Grube · 2015 [cited by applicant]
US 9110833B2 · Gladwin · 2015 [cited by applicant]
US 9417815B1 · Elisha · 2016 [cited by applicant]
US 9514010B2 · Buzzard · 2016 [cited by applicant]
US 9727275B2 · Kazi · 2017 [cited by applicant]
US 10073652B2 · Hegde · 2018 [cited by applicant]
US 10241695B2 · Baptist · 2019 [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 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 20060259686A1 · Sonobe · 2006 [cited by examiner]
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 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20110055474A1 · Resch · 2011 [cited by examiner]
US 20110213928A1 · Grube · 2011 [cited by examiner]
US 20110238936A1 · Hayden · 2011 [cited by applicant]
US 20110302369A1 · Goto · 2011 [cited by applicant]
US 20140331086A1 · Resch · 2014 [cited by applicant]
US 20140344216A1 · Abercrombie · 2014 [cited by applicant]
US 20150067231A1 · Sundarrajan · 2015 [cited by applicant]
US 20170147428A1 · Volvovski · 2017 [cited by applicant]
US 20170300374A1 · Gladwin · 2017 [cited by applicant]
US 20170300505A1 · Belmanu Sadananda · 2017 [cited by applicant]
US 20180074890A1 · Alnafoosi · 2018 [cited by applicant]
US 20180107421A1 · Kazi · 2018 [cited by applicant]
US 20190050280A1 · Khadiwala · 2019 [cited by applicant]
Ioannis Hadjipaschalis; Overview of current and future energy storage technologies for electric power applications; 2008; Elsevier; pp. 1-10. [cited by examiner]
Vivek Seshadri; RowClone: Fast and Energy-Efficient In-DRAM Bulk Data and Initialization; 2013; ACM;pp. 185-197. [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]
Li, Feihui; “Design and Management of 3D Chip Multiprocessors Using Network-in-Memory”; 2006; IEEEE; pp. 1-12. [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]
Zhu, Michael; “To prune, or not to prune: exploring the efficacy of pruning for model compression”; 2017; pp. 1-11. [cited by applicant]