Dynamic grow volume
Usage of a storage volume is monitored, including monitoring a write frequency and an overwrite frequency for the storage volume. The overwrite frequency may be obtained from garbage collection data for the storage volume. The write frequency and overwrite frequency may be used to obtain a growth rate and predict future usage of the storage volume. Where future usage indicates that expansion of storage allocated to the storage volume is needed, affinity requirements, anti-affinity requirements, and rebalancing reduction are evaluated with respect to the expansion. If expansion satisfies these constraints, the storage volume is locally expanded. Otherwise, the storage volume is relocated to a different storage device.
1 . An apparatus comprising:
a computing device including one or more processing devices and one or more memory devices operably coupled to the one or more processing devices, the one or more memory devices storing executable code that, when executed by the one or more processing devices, causes the one or more processing devices to:
monitor usage of a storage volume stored on one or more storage devices by:
monitoring a write frequency of the storage volume;
monitoring an overwrite frequency of the storage volume; and
calculating a growth rate as a difference between the write frequency and the overwrite frequency;
predict future usage of the storage volume; and
expand an allocated size of the storage volume in response to the future usage.
2 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to calculate the overwrite frequency from garbage collection data for the storage volume.
3 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to predict the future usage of the storage volume as a function of the growth rate.
4 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to expand the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume does not violate an affinity requirement.
5 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to expand the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume does not violate an anti-affinity requirement.
6 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to expand the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume reduces a need for rebalancing of a plurality of storage volumes including the storage volume.
7 . The apparatus of claim 1 , wherein the executable code, when executed by the one or more processing devices, further causes the one or more processing devices to expand the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume all of:
does not violate an affinity requirement;
does not violate an anti-affinity requirement; and
reduces a need for rebalancing of a plurality of storage volumes including the storage volume.
8 . A method comprising:
monitoring, by a computing device, usage of a storage volume stored on one or more storage devices by:
monitoring a write frequency of the storage volume;
monitoring an overwrite frequency of the storage volume; and
calculating a growth rate as a difference between the write frequency and the overwrite frequency;
predicting, by the computing device, future usage of the storage volume; and
expanding, by the computing device, an allocated size of the storage volume in response to the future usage.
9 . The method of claim 8 , further comprising calculating the overwrite frequency from garbage collection data for the storage volume.
10 . The method of claim 8 , further comprising predicting the future usage of the storage volume as a function of the growth rate.
11 . The method of claim 8 , further comprising expanding the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume does not violate an affinity requirement.
12 . The method of claim 8 , further comprising expanding the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume does not violate an anti-affinity requirement.
13 . The method of claim 8 , further comprising expanding the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume reduces a need for rebalancing of a plurality of storage volumes including the storage volume.
14 . The method of claim 8 , further comprising expanding the allocated size of the storage volume in response to the future usage only where expanding the allocated size of the storage volume all of:
does not violate an affinity requirement;
does not violate an anti-affinity requirement; and
reduces a need for rebalancing of a plurality of storage volumes including the storage volume.