EXTENT MIGRATION FOR TIERED STORAGE ARCHITECTURE
First Claim
1. A method for data migration between each of a plurality of storage pools in a computing storage environment by a processor device, comprising:
- categorizing each of the plurality of storage pools by a metric shared between data segments assigned to any one of the plurality of storage pools, wherein the data segments are prioritized in the any one of the plurality of storage pools based on the metric; and
performing, for each of the plurality of storage pools, at least one of;
discovering, on a predetermined interval and based on the metric, whether a data segment with a highest priority on a child pool of the plurality of storage pools is greater than a data segment with a lowest priority on a parent pool of the plurality of storage pools, promoting the data segment with the highest priority on the child pool to the parent pool if room is available, anddiscovering, on the predetermined interval and based on the metric, whether a data segment with a lowest priority on the child pool of the plurality of storage pools is less than a data segment with a highest priority on the parent pool of the priority of storage pools, demoting the data segment with the highest priority on the parent pool to the child pool if room is available;
wherein pursuant to the promoting the data segment with the highest priority on the parent pool to the child pool and the demoting the data segment with the highest priority on the parent pool to the child pool, a copy of the data segments with the highest priority on the child and parent pools are retained to allow for migration back in constant time.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for data migration between each of a plurality of storage pools in a computing storage environment is provided. Each of the plurality of storage pools is categorized by a metric shared between data segments assigned to any one of the plurality of storage pools. The data segments are prioritized in the any one of the plurality of storage pools based on the metric. A discovery is performed for each of the plurality of storage pools, on a predetermined interval, based on the metric, whether a data segment with a highest priority on a child pool is greater than a data segment with a lowest priority on a parent pool. If so, the data segment with the highest priority on the child pool is promoted to the parent pool. A similar discovery process demotes the data segment with the highest priority on the parent pool to the child pool.
48 Citations
25 Claims
-
1. A method for data migration between each of a plurality of storage pools in a computing storage environment by a processor device, comprising:
-
categorizing each of the plurality of storage pools by a metric shared between data segments assigned to any one of the plurality of storage pools, wherein the data segments are prioritized in the any one of the plurality of storage pools based on the metric; and performing, for each of the plurality of storage pools, at least one of; discovering, on a predetermined interval and based on the metric, whether a data segment with a highest priority on a child pool of the plurality of storage pools is greater than a data segment with a lowest priority on a parent pool of the plurality of storage pools, promoting the data segment with the highest priority on the child pool to the parent pool if room is available, and discovering, on the predetermined interval and based on the metric, whether a data segment with a lowest priority on the child pool of the plurality of storage pools is less than a data segment with a highest priority on the parent pool of the priority of storage pools, demoting the data segment with the highest priority on the parent pool to the child pool if room is available; wherein pursuant to the promoting the data segment with the highest priority on the parent pool to the child pool and the demoting the data segment with the highest priority on the parent pool to the child pool, a copy of the data segments with the highest priority on the child and parent pools are retained to allow for migration back in constant time. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system for data migration between each of a plurality of storage pools in a computing storage environment, comprising:
a storage manager module operational in the computing storage environment, wherein the storage manager module is adapted for; categorizing each of the plurality of storage pools by a metric shared between data segments assigned to any one of the plurality of storage pools, wherein the data segments are prioritized in the any one of the plurality of storage pools based on the metric, and performing, for each of the plurality of storage pools, at least one of; discovering, on a predetermined interval and based on the metric, whether a data segment with a highest priority on a child pool of the plurality of storage pools is greater than a data segment with a lowest priority on a parent pool of the plurality of storage pools, promoting the data segment with the highest priority on the child pool to the parent pool if room is available, and discovering, on the predetermined interval and based on the metric, whether a data segment with a lowest priority on the child pool of the plurality of storage pools is less than a data segment with a highest priority on the parent pool of the priority of storage pools, demoting the data segment with the highest priority on the parent pool to the child pool if room is available; wherein pursuant to the promoting the data segment with the highest priority on the parent pool to the child pool and the demoting the data segment with the highest priority on the parent pool to the child pool, a copy of the data segments with the highest priority on the child and parent pools are retained to allow for migration back in constant time. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17)
-
18. A computer program product for data migration between each of a plurality of storage pools in a computing storage environment by a processor device, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
-
a first executable portion for categorizing each of the plurality of storage pools by a metric shared between data segments assigned to any one of the plurality of storage pools, wherein the data segments are prioritized in the any one of the plurality of storage pools based on the metric; and a second executable portion for performing, for each of the plurality of storage pools, at least one of; discovering, on a predetermined interval and based on the metric, whether a data segment with a highest priority on a child pool of the plurality of storage pools is greater than a data segment with a lowest priority on a parent pool of the plurality of storage pools, promoting the data segment with the highest priority on the child pool to the parent pool if room is available, and discovering, on the predetermined interval and based on the metric, whether a data segment with a lowest priority on the child pool of the plurality of storage pools is less than a data segment with a highest priority on the parent pool of the priority of storage pools, demoting the data segment with the highest priority on the parent pool to the child pool if room is available; wherein pursuant to the promoting the data segment with the highest priority on the parent pool to the child pool and the demoting the data segment with the highest priority on the parent pool to the child pool, a copy of the data segments with the highest priority on the child and parent pools are retained to allow for migration back in constant time. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25)
-
Specification