IP Library Granted Patent US 12,197,768
Granted Patent B2
US 12,197,768 · App. 17/818,067 · Granted Jan 14, 2025

Facilitating write requests in a storage network

Inventors: Jason K. Resch (Warwick, RI); Andrew D. Baptist (Mt. Pleasant, WI); Niall J. McShane (Arlington Heights, IL); Greg R. Dhuse (Chicago, IL); Thomas F. Shirley, Jr. (Oconomowoc, WI); Gregory Palinckx (Cherry Hills Village, CO); Russell P. Kennedy (Broomfield, CO); S. Christopher Gladwin (Chicago, IL); Robert C. McCammon (Downer Grove, IL); James Sherer (Lake Zurich, IL)
Assignee: Pure Storage, Inc.
G06F3/0655G06F3/0604G06F3/067
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,197,768
App. No.
17/818,067
Granted
Jan 14, 2025
Kind
B2
Abstract

A processing system of a storage network operates by receiving a write request associated with a data object; identifying dispersed storage error encoding parameters; and determining a number of available storage units. When the number of available storage units is determined to exceed a first number, the processing system operates by: determining a first write threshold number in accordance with the dispersed storage error encoding parameters; dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and writing, to available storage units, the first write threshold number of encoded data slices. When the number of available storage units is determined to not exceed the first number, the processing system operates by: determining a second write threshold number in accordance with the dispersed storage error encoding parameters associated, wherein the second write threshold number is less than the first write threshold number; dispersed error encoding the data object to produce a second write threshold number of encoded data slices; and writing, to the available storage units, the second write threshold number of encoded data slices.

Claims (46)

1. A method for execution by a processing system of a storage network that includes a processor, the method comprises:

receiving, via the processing system, a write request associated with a data object;

identifying, via the processing system, dispersed storage error encoding parameters;

determining, via the processing system, a number of available storage units;

determining a write threshold number that is based on the number of available storage units by:

when the number of available storage units is determined to exceed a first number:

determining, via the processing system, the write threshold number to be equal to a first write threshold number in accordance with the dispersed storage error encoding parameters;

dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and

writing, to available storage units, the first write threshold number of encoded data slices;

when the number of available storage units is determined to not exceed the first number:

determining, via the processing system, the write threshold number to be equal to a second write threshold number in accordance with the dispersed storage error encoding parameters associated, wherein the second write threshold number is less than the first write threshold number;

dispersed error encoding the data object to produce a second write threshold number of encoded data slices; and

writing, to the available storage units, the second write threshold number of encoded data slices.

2. The method of claim 1 , wherein identifying the dispersed storage error encoding parameters includes an information dispersal algorithm (IDA) width and a decode threshold number.

3. The method of claim 2 , wherein identifying the IDA width and the decode threshold number includes at least one of: interpreting a portion of a system registry information, receiving the IDA width and decode threshold number, determining the IDA width and the decode threshold number.

4. The method of claim 1 , wherein determining the number of available storage units includes initiating a query and interpreting a query response.

5. The method of claim 1 , wherein determining the number of available storage units includes at least one of: performing a test, interpreting an error message, performing a lookup, or generating an estimate.

6. The method of claim 1 , wherein the dispersed storage error encoding parameters includes a decode threshold number.

7. The method of claim 6 , wherein the first write threshold number is greater than the decode threshold number and less than the number of available storage units.

8. The method of claim 6 , wherein the first write threshold number is greater than the decode threshold number and equal to the number of available storage units.

9. The method of claim 6 , wherein the second write threshold number is equal to the decode threshold number and equal to the number of available storage units.

10. The method of claim 6 , wherein the second write threshold number is equal to the decode threshold number and less than the number of available storage units.

11. A processing system of a storage network 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 perform operations including:

receiving a write request associated with a data object;

identifying dispersed storage error encoding parameters;

determining a number of available storage units;

determining a write threshold number that is based on the number of available storage units by:

when the number of available storage units is determined to exceed a first number:

determining the write threshold number to be equal to a first write threshold number in accordance with the dispersed storage error encoding parameters;

dispersed error encoding the data object to produce a first write threshold number of encoded data slices; and

writing, to available storage units, the first write threshold number of encoded data slices;

when the number of available storage units is determined to not exceed the first number:

determining the write threshold number to be equal to a second write threshold number in accordance with the dispersed storage error encoding parameters associated, wherein the second write threshold number is less than the first write threshold number;

dispersed error encoding the data object to produce a second write threshold number of encoded data slices; and

writing, to the available storage units, the second write threshold number of encoded data slices.

12. The processing system of claim 11 , wherein identifying the dispersed storage error encoding parameters includes an information dispersal algorithm (IDA) width and a decode threshold number.

13. The processing system of claim 12 , wherein identifying the IDA width and the decode threshold number includes at least one of: interpreting a portion of a system registry information, receiving the IDA width and decode threshold number, determining the IDA width and the decode threshold number.

14. The processing system of claim 11 , wherein determining the number of available storage units includes initiating a query and interpreting a query response.

15. The processing system of claim 11 , wherein determining the number of available storage units includes at least one of: performing a test, interpreting an error message, performing a lookup, or generating an estimate.

16. The processing system of claim 11 , wherein the dispersed storage error encoding parameters includes a decode threshold number.

17. The processing system of claim 16 , wherein the first write threshold number is greater than the decode threshold number and less than the number of available storage units.

18. The processing system of claim 16 , wherein the first write threshold number is greater than the decode threshold number and equal to the number of available storage units.

19. The processing system of claim 16 , wherein the second write threshold number is equal to the decode threshold number and equal to the number of available storage units.

20. The processing system of claim 16 , wherein the second write threshold number is equal to the decode threshold number and less than the number of available storage units.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2022
From: RESCH, JASON K.; BAPTIST, ANDREW D.; MCSHANE, NIALL J.; DHUSE, GREG R.; SHIRLEY, THOMAS F., JR.; PALINCKX, GREGORY; KENNEDY, RUSSELL P.; GLADWIN, S. CHRISTOPHER; MCCAMMON, ROBERT C.; SHERER, JAMES
To: PURE STORAGE, INC.
Reel/Frame 060754/0306 →
Continuity (5)
Continuation In Part 16547921 · Aug 22, 2019
Continuation In Part 15978596 · May 14, 2018
Continuation In Part 14794723 · Jul 8, 2015
Provisional Application 62046444 · Sep 5, 2014
Related Publication 20220374162A1 · Nov 24, 2022
References Cited (105)
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, 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 20090094251A1 · Gladwin · 2009 [cited by applicant]
US 20090094318A1 · Gladwin · 2009 [cited by applicant]
US 20100023524A1 · Gladwin · 2010 [cited by applicant]
US 20110286594A1 · Resch · 2011 [cited by applicant]
US 20110289283A1 · Baptist · 2011 [cited by applicant]
US 20110289383A1 · Dhuse · 2011 [cited by examiner]
US 20110289577A1 · Resch · 2011 [cited by examiner]
US 20120198066A1 · Grube · 2012 [cited by applicant]
US 20120226933A1 · Baptist · 2012 [cited by applicant]
US 20120254692A1 · Resch · 2012 [cited by applicant]
US 20120291099A1 · Grube · 2012 [cited by examiner]
US 20130046973A1 · Resch · 2013 [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]