IP Library › Granted Patent US 10,296,214
Granted Patent B2
US 10,296,214 · App. 15/339,278 · Granted May 21, 2019

Storage pool selection for provisioning volumes in an over-allocation system

Inventors: Ohad Atia (Haifa, IL); Amalia Avraham (Petach Tikva, IL); Ran Harel (Kfar-Saba, IL); Alon Marx (Matan, IL); Olga Shtivelman (Karmiel, IL)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F3/0604G06F3/0631G06F3/0644G06F3/0683
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,296,214
App. No.
15/339,278
Granted
May 21, 2019
Kind
B2
Abstract

Embodiments for volume management in a data storage environment. A storage pool of a plurality of storage pools is selected to provision at least one storage volume by calculating, for each of the plurality of storage pools, a forecast factor representing an expected usage according to an overall size of the at least one storage volume. The selected storage pool is the storage pool of the plurality of storage pools having a smallest forecast factor.

Claims (103)

1. A method for volume management in a data storage environment, by a processor device, comprising:

selecting a storage pool of a plurality of storage pools to provision at least one storage volume by calculating, for each of the plurality of storage pools, a forecast factor representing an expected usage according to an overall size of the at least one storage volume, the expected usage comprising a predicted used capacity of each one of the plurality of storage pools over a predetermined period of time; wherein the selected storage pool is the storage pool of the plurality of storage pools having a smallest forecast factor; and wherein the forecast factor is calculated in accordance with the equation:

V

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

K

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

;

where V(P) is a sum of a size of all storage volumes including the at least one storage volume in a given storage pool P of the plurality of storage pools, K(P) is a capacity of the given storage pool P, and Y(P, T) is the predicted used capacity for the given storage pool P at time T; and

provisioning the at least one storage volume within the selected storage pool of the plurality of storage pools having the smallest forecast factor notwithstanding whether the selected storage pool has a largest free physical capacity of the plurality of storage pools.

2. The method of claim 1 , wherein the forecast factor is determined while considering an over-allocation ratio of each one of the plurality of storage pools.

3. The method of claim 1 , further including using historical capacity usage data of each of the plurality of storage pools to generate the predicted used capacity.

4. The method of claim 1 , further including selecting a plurality of time points T and comparing an output value of the equation using the selected plurality of time points T for each of the plurality of pools to determine the selected storage pool having the smallest forecast factor.

5. A system for volume management in a data storage environment, the system comprising:

a processor device operating within and between distributed computing components, wherein the processor device:

selects a storage pool of a plurality of storage pools to provision at least one storage volume by calculating, for each of the plurality of storage pools, a forecast factor representing an expected usage according to an overall size of the at least one storage volume, the expected usage comprising a predicted used capacity of each one of the plurality of storage pools over a predetermined period of time; wherein the selected storage pool is the storage pool of the plurality of storage pools having a smallest forecast factor; and wherein the forecast factor is calculated in accordance with the equation:

V

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

K

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

;

where V(P) is a sum of a size of all storage volumes including the at least one storage volume in a given storage pool P of the plurality of storage pools, K(P) is a capacity of the given storage pool P, and Y(P, T) is the predicted used capacity for the given storage pool P at time T; and

provisions the at least one storage volume within the selected storage pool of the plurality of storage pools having the smallest forecast factor notwithstanding whether the selected storage pool has a largest free physical capacity of the plurality of storage pools.

6. The system of claim 5 , wherein the forecast factor is determined while considering an over-allocation ratio of each one of the plurality of storage pools.

7. The system of claim 5 , wherein the processor device uses historical capacity usage data of each of the plurality of storage pools to generate the predicted used capacity.

8. The system of claim 5 , wherein the processor device selects a plurality of time points T and comparing an output value of the equation using the selected plurality of time points T for each of the plurality of pools to determine the selected storage pool having the smallest forecast factor.

9. A computer program product for volume management in a data storage environment, by a processor device, the computer program product embodied on a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

an executable portion that selects a storage pool of a plurality of storage pools to provision at least one storage volume by calculating, for each of the plurality of storage pools, a forecast factor representing an expected usage according to an overall size of the at least one storage volume, the expected usage comprising a predicted used capacity of each one of the plurality of storage pools over a predetermined period of time; wherein the selected storage pool is the storage pool of the plurality of storage pools having a smallest forecast factor; and wherein the forecast factor is calculated in accordance with the equation:

V

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

K

⁡

(

P

)

-

Y

⁡

(

P

,

T

)

;

where V(P) is a sum of a size of all storage volumes including the at least one storage volume in a given storage pool P of the plurality of storage pools, K(P) is a capacity of the given storage pool P, and Y(P, T) is the predicted used capacity for the given storage pool P at time T; and

an executable portion that provisions the at least one storage volume within the selected storage pool of the plurality of storage pools having the smallest forecast factor notwithstanding whether the selected storage pool has a largest free physical capacity of the plurality of storage pools.

10. The computer program product of claim 9 , wherein the forecast factor is determined while considering an over-allocation ratio of each one of the plurality of storage pools.

11. The computer program product of claim 9 , further including an executable portion that uses historical capacity usage data of each of the plurality of storage pools to generate the predicted used capacity.

12. The computer program product of claim 9 , further including an executable portion that selects a plurality of time points T and comparing an output value of the equation using the selected plurality of time points T for each of the plurality of pools to determine the selected storage pool having the smallest forecast factor.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 31, 2016
From: ATIA, OHAD; AVRAHAM, AMALIA; HAREL, RAN; MARX, ALON; SHTIVELMAN, OLGA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 040177/0618 →
Continuity (1)
Related Publication 20180121095A1 · May 3, 2018