Unfavorable storage growth rate abatement

• US 10,089,180 B2
• Filed: 05/02/2016
• Issued: 10/02/2018
• Est. Priority Date: 07/31/2015
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: International Business Machines Corporation
• Inventors: Cilfone, Bart R., Khadiwala, Ravi V., McShane, Niall J., Motwani, Manish, Resch, Jason K., Shree, Shikha
• Primary Examiner(s): Wilson, Yolanda L
• Application Number:
  US15/144,189
• Publication Number:
  US 20170031752A1
• Time in Patent Office: 883 Days
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 11/108 Parity data distribution in semiconductor storages, e.g. in SSD
• CPC Class Codes: G06F 11/1662 the resynchronized component or unit being a persistent storage device re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008
• CPC Class Codes: G06F 11/3034 where the computing system component is a storage system, e.g. DASD based or network based digital input from or digital output to record carriers G06F3/06; digital recording or reproducing G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097
• CPC Class Codes: G06F 13/4282 on a serial bus, e.g. I2C bus, SPI bus on daisy chain buses G06F13/4247
• CPC Class Codes: G06F 16/122 using management policies backup systems G06F11/1446; file migration policies for HSM systems G06F16/185
• CPC Class Codes: G06F 16/1824 implemented using Network-attached Storage [NAS] architecture distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 21/645 using a third party
• CPC Class Codes: G06F 2201/805 Real-time
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/0605 by facilitating the interaction with a user or administrator
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/0622 in relation to access
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/0643 Management of files
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0647 Migration mechanisms
• CPC Class Codes: G06F 3/065 : Replication mechanisms
• CPC Class Codes: G06F 3/0653 : Monitoring storage devices or systems
• CPC Class Codes: G06F 3/0668 : adopting a particular infrastructure
• CPC Class Codes: G06F 3/067 : Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
• CPC Class Codes: G06F 3/0689 : Disk arrays, e.g. RAID, JBOD
• CPC Class Codes: H03M 13/1515 : Reed-Solomon codes
• CPC Class Codes: H03M 13/2906 : using block codes H03M13/2957 takes precedence
• CPC Class Codes: H03M 13/3761 : using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
• CPC Class Codes: H04L 63/0428 : wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/061 : for key exchange, e.g. in peer-to-peer networks cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838
• CPC Class Codes: H04L 63/0853 : using an additional device, e.g. smartcard, SIM or a different communication terminal cryptographic mechanisms or cryptographic arrangements for entity authentication involving additional secure or trusted devices H04L9/3234
• CPC Class Codes: H04L 63/108 : when the policy decisions are valid for a limited amount of time
• CPC Class Codes: H04L 67/1097 : for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/63 : Routing a service request depending on the request content or context
• CPC Class Codes: H04L 9/0861 : Generation of secret information including derivation or calculation of cryptographic keys or passwords

Abstract

A method begins by a processing module determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units. The method continues with the processing module when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach such that estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices. The method continues with the processing module facilitating implementation of the unfavorable growth rate abatement approach.

Claims

1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises:

determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units;

when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach such that an estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices; and

facilitating implementation of the unfavorable growth rate abatement approach.

2. The method of claim 1, wherein the reallocating is in accordance with updated weighting factors of a distributed agreement protocol function.

3. The method of claim 1, wherein the growth rate is indicated unfavorable when an estimated number of new encoded data slices minus an estimated number of deleted encoded data slices minus a number of encoded data slices for reallocation is greater than an available storage capacity of the storage unit.

4. The method of claim 1, wherein the unfavorable growth rate abatement approach is based on one or more of:

a prioritization request, a schedule, a DSN activity level, or a maximum estimated reallocation rate.

5. The method of claim 1, wherein the unfavorable growth rate abatement approach is based on one or more of:

lower a rate of storing new encoded data slices, raise a rate of deleting encoded data slices, or raising a rate of reallocating encoded data slices.

6. The method of claim 1, wherein the facilitating includes one or more of:

speeding up a rate of reallocating of the at least a portion of encoded data slices or slowing down writing of new encoded data slices.

7. The method of claim 1, wherein the facilitating includes speeding up a rate of deletions, in the first storage unit, of reallocated encoded data slices.

8. The method of claim 1, wherein the facilitating includes throttling writing new encoded data slices by a percentage.

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

at least one memory section that stores operational instructions that, when executed by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), causes the one or more computing devices to;

determine, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units;

when the storage growth rate is unfavorable, select an unfavorable growth rate abatement approach such that an estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices; and

facilitate implementation of the unfavorable growth rate abatement approach.

10. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

reallocate in accordance with updated weighting factors of a distributed agreement protocol function.

11. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

indicate the unfavorable growth rate when an estimated number of new encoded data slices minus an estimated number of deleted encoded data slices minus a number of encoded data slices for reallocation is greater than an available storage capacity of the storage unit.

12. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

base the unfavorable growth rate abatement approach on one or more of;

a prioritization request, a schedule, a DSN activity level, or a maximum estimated reallocation rate.

13. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

base the unfavorable growth rate abatement approach on one or more of;

lower a rate of storing new encoded data slices, raise a rate of deleting encoded data slices, or raising a rate of reallocating encoded data slices.

14. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

facilitate based on one or more of;

speeding up a rate of reallocating of the at least a portion of encoded data slices or slowing down writing of new encoded data slices.

15. The non-transitory computer readable storage medium of claim 9 further comprises:

the at least one memory section stores further operational instructions that, when executed by the one or more processing modules, causes the one or more computing devices of the DSN to;

facilitate based on speeding up a rate of deletions, in the first storage unit, of reallocated encoded data slices.

16. A computing device of a group of computing devices of a dispersed storage network (DSN), the computing device comprises:

an interface;

a local memory; and

a processing module operably coupled to the interface and the local memory, wherein the processing module functions to;

determine, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units;

when the storage growth rate is unfavorable, select an unfavorable growth rate abatement approach such that an estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices; and

facilitate implementation of the unfavorable growth rate abatement approach.

17. The computing device of claim 16, wherein the growth rate is indicated unfavorable when an estimated number of new encoded data slices minus an estimated number of deleted encoded data slices minus a number of encoded data slices for reallocation is greater than an available storage capacity of the storage unit.

18. The computing device of claim 16, wherein the unfavorable growth rate abatement approach is based on one or more of:

a prioritization request, a schedule, a DSN activity level, or a maximum estimated reallocation rate.

19. The computing device of claim 16, wherein the unfavorable growth rate abatement approach is based on one or more of:

lower a rate of storing new encoded data slices, raise a rate of deleting encoded data slices, or raising a rate of reallocating encoded data slices.

20. The computing device of claim 16, wherein the facilitating includes one or more of:

speeding up a rate of reallocating of the at least a portion of encoded data slices, speeding up a rate of deletions, in the first storage unit, of reallocated encoded data slices, or slowing down writing of new encoded data slices.