IP Library Granted Patent US 10,089,180
Granted Patent B2
US 10,089,180 · App. 15/144,189 · Granted Oct 2, 2018

Unfavorable storage growth rate abatement

Inventors: Bart R. Cilfone (Chicago, IL); Ravi V. Khadiwala (Bartlett, IL); Niall J. McShane (Arlington Heights, IL); Manish Motwani (Chicago, IL); Jason K. Resch (Chicago, IL); Shikha Shree (Chicago, IL)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F11/108G06F3/061G06F3/0604G06F3/0605G06F3/065G06F3/067G06F3/0619G06F3/0622G06F3/0643G06F3/0644G06F3/0647G06F3/0653G06F3/0668G06F3/0689G06F11/1076G06F11/1662G06F11/3034G06F13/4282G06F17/3053G06F17/30082G06F17/30197G06F21/6218G06F21/645H03M13/2906H03M13/3761H04L9/0861H04L63/061H04L63/0853H04L63/108H04L67/1097H04L67/327G06F3/064G06F2201/805H03M13/1515H04L63/0428
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 10,089,180
App. No.
15/144,189
Granted
Oct 2, 2018
Kind
B2
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 (45)

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.

Assignments (5)
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Recorded Jun 11, 2025
From: BARCLAYS BANK PLC, AS ADMINISTRATIVE AGENT
To: PURE STORAGE, INC.
Reel/Frame 071558/0523 →
SECURITY INTEREST Recorded Aug 26, 2020
From: PURE STORAGE, INC.
To: BARCLAYS BANK PLC AS ADMINISTRATIVE AGENT
Reel/Frame 053867/0581 →
CORRECTIVE ASSIGNMENT TO CORRECT THE 9992063 AND 10334045 LISTED IN ERROR PREVIOUSLY RECORDED ON REEL 049556 FRAME 0012. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNOR HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jan 14, 2020
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 052205/0705 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2019
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: PURE STORAGE, INC.
Reel/Frame 049556/0012 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2016
From: CILFONE, BART R.; KHADIWALA, RAVI V.; MCSHANE, NIALL J.; MOTWANI, MANISH; RESCH, JASON K.; SHREE, SHIKHA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 038437/0311 →
Continuity (2)
Provisional Application 62199816 · Jul 31, 2015
Related Publication 20170031752A1 · Feb 2, 2017