Unfavorable storage growth rate abatement

Patent metadata

Field	Value
Publication number	US-10089180-B2
Application number	US-201615144189-A
Country	US
Kind code	B2
Filing date	May 2, 2016
Priority date	Jul 31, 2015
Publication date	Oct 2, 2018
Grant date	Oct 2, 2018

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.

First claim

What is claimed is:

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 enc

Assignees

• IBM

Inventors

• Cilfone Bart R
• Khadiwala Ravi V
• Mcshane Niall J
• Motwani Manish
• Resch Jason K
• Shree Shikha

Classifications

• G06F3/061

  Improving I/O performance · CPC title

• G06F3/0647

  Migration mechanisms · CPC title

• G06F21/6218

  to a system of files or objects, e.g. local or distributed file system or database · CPC title

• H04L63/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 title

• G06F11/1076

  Parity data used in redundant arrays of independent storages, e.g. in RAID systems · CPC title