IP Library Granted Patent US 12,379,840
Granted Patent B2
US 12,379,840 · App. 18/592,710 · Granted Aug 5, 2025

Producing recovered data in a storage network

Inventors: Bruno H. Cabral (Chicago, IL); Wesley B. Leggette (Chicago, IL)
Assignee: Pure Storage, Inc.
G06F3/0604G06F3/0619G06F3/0644G06F3/0659G06F3/0661G06F3/067G06F11/1076G06F11/1092G06F21/62G06F21/64H03M7/6011H04L1/00H04L1/0045H04L1/0057H04L1/0076H04L9/085H04L9/0894H04L63/10H04L63/101H04L63/102H04L67/06H04L67/10H04L67/1097H04L67/565G06F2211/1028G06F2212/254H03M13/1515H03M13/616H04L63/12H04L2209/30H04L2209/34H04L2209/608
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,379,840
App. No.
18/592,710
Granted
Aug 5, 2025
Kind
B2
Abstract

A storage network operates by: issuing read slice requests to storage units of a set of storage units, where the read slice requests identify at least a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment; when less than the read threshold number of encoded slices are received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices; decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

Claims (36)

1. A method comprises:

issuing read slice requests to storage units of a set of storage units, where the read slice requests identify at least a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment;

when less than the read threshold number of encoded slices are received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices;

decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and

outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

2. The method of claim 1 , wherein the data segment was dispersed storage error encoded to produce the set of encoded slices.

3. The method of claim 1 , wherein the set of encoded slices for the corresponding data segment includes a first subset of encoded data slices and includes a second subset of encoded code slices, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive with respect to the set of encoded slices, wherein the encoded data slices received within response timeframe are elements of the first subset and wherein at least one of the recovered encoded data slices is an element of the second subset.

4. The method of claim 3 , wherein a size of the first subset corresponds the decode threshold number.

5. The method of claim 3 , further comprising

determining a subset of the set of encoded slices received within the time threshold;

determining a number of necessary remaining slices based on subtracting a size of the subset from the decode threshold number; and

generating a set of additional requests for transmission to the storage units of the set of storage units, wherein a number of additional requests of the set is equal to the number of necessary remaining slices, and wherein the set of additional requests indicate encoded code slices of the second subset.

6. The method of claim 5 , wherein no additional requests are transmitted to the storage units of the set of storage units in response to number of necessary remaining slices being determined to be equal to zero.

7. The method of claim 3 , wherein the read threshold number of read slice requests is determined by selecting an entirety of the first subset to be included in the read threshold number of read slice requests.

8. The method of claim 1 , wherein outputting of the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold is in accordance with a data slice ordering, and wherein the data slice ordering is based on consecutive data of the corresponding data segment.

9. The method of claim 8 , wherein the read threshold number of read slice requests to storage units are transmitted consecutively at a corresponding plurality of different times in an order corresponding to the data slice ordering.

10. The method of claim 8 , wherein a requesting entity reproduces the data segment in accordance with the data slice ordering.

11. A processing system comprises:

at least one processor; and

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

issuing read slice requests to storage units of a set of storage units, where the read slice requests identify at least a read threshold number of encoded slices of a set of encoded slices corresponding to a data segment;

when less than the read threshold number of encoded slices are received within a time threshold, facilitating receiving a decode threshold number of encoded slices of the set of encoded slices;

decoding the decode threshold number of encoded slices to produce recovered encoded data slices, wherein a number of the recovered encoded data slices corresponds to the read threshold number minus a number of the encoded slices received within the time threshold; and

outputting the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold.

12. The processing system of claim 11 , wherein the data segment was dispersed storage error encoded to produce the set of encoded slices.

13. The processing system of claim 11 , wherein the set of encoded slices for the corresponding data segment includes a first subset of encoded data slices and includes a second subset of encoded code slices, wherein the first subset and the second subset are mutually exclusive and collectively exhaustive with respect to the set of encoded slices, wherein the encoded data slices received within response timeframe are elements of the first subset and wherein at least one of the recovered encoded data slices is an element of the second subset.

14. The processing system of claim 13 , wherein a size of the first subset corresponds the decode threshold number.

15. The processing system of claim 13 , wherein the operations further include:

determining a subset of the set of encoded slices received within the time threshold;

determining a number of necessary remaining slices based on subtracting a size of the subset from the decode threshold number; and

generating a set of additional requests for transmission to the storage units of the set of storage units, wherein a number of additional requests of the set is equal to the number of necessary remaining slices, and wherein the set of additional requests indicate encoded code slices of the second subset.

16. The processing system of claim 15 , wherein no additional requests are transmitted to the storage units of the set of storage units in response to number of necessary remaining slices being determined to be equal to zero.

17. The processing system of claim 13 , wherein the read threshold number of read slice requests is determined by selecting an entirety of the first subset to be included in the read threshold number of read slice requests.

18. The processing system of claim 11 , wherein outputting of the recovered encoded data slices and the encoded slices of the read threshold number of encoded slices received within the time threshold is in accordance with a data slice ordering, and wherein the data slice ordering is based on consecutive data of the corresponding data segment.

19. The processing system of claim 18 , wherein the read threshold number of read slice requests to storage units are transmitted consecutively at a corresponding plurality of different times in an order corresponding to the data slice ordering.

20. The processing system of claim 18 , wherein a requesting entity reproduces the data segment in accordance with the data slice ordering.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2024
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 066764/0632 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 7, 2024
From: CABRAL, BRUNO H.; LEGGETTE, WESLEY B.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 066675/0873 →
Continuity (9)
Continuation 18045694 · Oct 11, 2022
Continuation 17446841 · Sep 3, 2021
Continuation 16850193 · Apr 16, 2020
Continuation 16165608 · Oct 19, 2018
Continuation In Part 15841759 · Dec 14, 2017
Continuation In Part 15450470 · Mar 6, 2017
Continuation 14589639 · Jan 5, 2015
Provisional Application 61944722 · Feb 26, 2014
Related Publication 20240201849A1 · Jun 20, 2024
References Cited (112)
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 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 · 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 · 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 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20090144516A1 · Sandorfi · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20110072321A1 · Dhuse · 2011 [cited by applicant]
US 20110214011A1 · Grube · 2011 [cited by applicant]
US 20110225362A1 · Leggette · 2011 [cited by applicant]
US 20110311051A1 · Resch · 2011 [cited by applicant]
US 20120054456A1 · Grube · 2012 [cited by applicant]
US 20120089809A1 · Resch · 2012 [cited by examiner]
US 20120102316A1 · Resch · 2012 [cited by applicant]
US 20120110390A1 · Grube · 2012 [cited by applicant]
US 20120137091A1 · Grube et al. · 2012 [cited by applicant]
US 20120311345A1 · Dhuse · 2012 [cited by examiner]
US 20130086450A1 · Grube · 2013 [cited by applicant]
US 20130304745A1 · Dhuse · 2013 [cited by applicant]
US 20130304746A1 · Dhuse · 2013 [cited by applicant]
US 20140101116A1 · Alnafoosi · 2014 [cited by applicant]
US 20140351659A1 · Dhuse · 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]