Method, electronic device and computer program product for managing disks
Techniques for managing disks involve: in response to a number of a plurality of disks to be partitioned being greater than a predetermined number of disks in a disk set, determining a plurality of candidate combinations of disk sets from the plurality of disks. The techniques further involve selecting a target combination from the plurality of candidate combinations, a first disk set of the target combination comprising at least a first subset corresponding to a first disk array, a second disk set of the target combination comprising at least a second subset corresponding to a second disk array, a number of disks in the first subset and a number of disks in the second subset being both equal to a first number and the disks in the first subset being different from the disks in the second subset. Accordingly, such techniques improve the storage efficiency of the disk array.
1. A method of managing disks, comprising:
in response to a number of a plurality of disks to be partitioned into disk sets being greater than a predetermined maximum number of disks per disk set, determining a plurality of candidate combinations of disks into disk sets; and
selecting a target combination from the plurality of candidate combinations, a first disk set of the target combination comprising at least a first subset of the first disk set corresponding to a first disk array, a second disk set of the target combination comprising at least a second subset of the second disk set corresponding to a second disk array, a number of disks in the first subset and a number of disks in the second subset being both equal to a first number and the disks in the first subset being different from the disks in the second subset, wherein selecting the target combination from the plurality of candidate combinations comprises:
selecting a plurality of intermediate combinations from the plurality of candidate combinations, a disk set of each of the plurality of intermediate combinations comprising at least a first subset for that intermediate combination, and a further disk set of the intermediate combination comprising at least a second subset for that intermediate combination;
calculating a first group of unavailable capacities for the respective first subsets for the plurality of intermediate combinations; and
calculating a second group of unavailable capacities for the respective second subsets for the plurality of intermediate combinations.
2. The method according to claim 1 , wherein selecting the target combination from the plurality of candidate combinations further comprises:
determining the target combination from the plurality of intermediate combinations based on the first group of unavailable capacities and the second group of unavailable capacities to enable a sum of an unavailable capacity of the first group of unavailable capacities for the first subset for that target combination and an unavailable capacity of the second group of unavailable capacities for the second subset for that target combination to be smaller than or equal to a predetermined threshold.
3. The method according to claim 2 , wherein calculating the first group of unavailable capacities comprises:
determining a minimum capacity from among respective predetermined capacities of a plurality of disks in the first subset for one of the plurality of intermediate combinations; and
determining an excess capacity in relation to the minimum capacity for each of the plurality of disks in the first subset for the one of the plurality of intermediate combinations;
determining an unavailable capacity for the first subset for the one of the plurality of intermediate combinations based on the excess capacity.
4. The method according to claim 1 , wherein a number of disks other than the first subset in the first disk set of the target combination is greater than or equal to the first number and smaller than or equal to the predetermined maximum number of disks.
5. The method according to claim 1 , wherein a number of disks contained in the second disk set for the target combination is equal to the first number.
6. The method according to claim 1 , further comprising:
in response to the number of the plurality of disks being smaller than or equal to the predetermined maximum number of disks, determining the plurality of disks as disks in the first disk set.
7. An electronic device, comprising:
a processor; and
a memory storing computer program instructions, the processor executing the computer program instructions in the memory to control the electronic device to perform acts, the acts comprising:
in response to a number of a plurality of disks to be partitioned into disk sets being greater than a predetermined maximum number of disks per disk set, determining a plurality of candidate combinations of disks into disk sets; and
selecting a target combination from the plurality of candidate combinations, the target combination including a first disk set of the disk sets and a second disk set of the disk sets, the first disk set of the target combination comprising at least a first subset of disks corresponding to a first disk array, the second disk set of the target combination comprising at least a second subset of disks corresponding to a second disk array, a number of disks in the first subset and a number of disks in the second subset being both equal to a first number and the disks in the first subset being different from the disks in the second subset, wherein a number of disks other than the first subset in the first disk set of the target combination is greater than or equal to the first number, and smaller than predetermined maximum number of disks.
8. The electronic device according to claim 7 , wherein selecting the target combination from the plurality of candidate combinations comprises:
selecting a plurality of intermediate combinations from the plurality of candidate combinations, a disk set of each of the plurality of intermediate combinations comprising at least a first subset for that intermediate combination, and a further disk set of the intermediate combination comprising at least a second subset for that intermediate combination;
calculating a first group of unavailable capacities for the respective first subsets for the plurality of intermediate combinations;
calculating a second group of unavailable capacities for the respective second subsets for the plurality of intermediate combinations; and
determining the target combination from the plurality of intermediate combinations based on the first group of unavailable capacities and the second group of unavailable capacities to enable a sum of an unavailable capacity of the first group of unavailable capacities for the first subset for that target combination and an unavailable capacity of the second group of unavailable capacities for the second subset for that target combination to be smaller than or equal to a predetermined threshold.
9. The electronic device according to claim 8 , wherein calculating the first group of unavailable capacities comprises:
determining a minimum capacity from among respective predetermined capacities of a plurality of disks in the first subset for one of the plurality of intermediate combinations; and
determining an excess capacity in relation to the minimum capacity for each of the plurality of disks in the first subset for the one of the plurality of intermediate combinations;
determining an unavailable capacity for the first subset for the one of the plurality of intermediate combinations based on the excess capacity.
10. The electronic device according to claim 7 , wherein a number of disks contained in the second disk set for the target combination is equal to the first number.
11. The electronic device according to claim 7 , wherein the acts further comprise:
in response to the number of the plurality of disks being smaller than or equal to the predetermined maximum number of disks, determining the plurality of disks as disks in the first disk set.
12. A computer program product having a non-transitory computer readable medium which stores a set of instructions to manage disks; the set of instructions, when carried out by computerized circuitry, causing the computerized circuitry to perform a method of:
in response to a number of a plurality of disks to be partitioned into disk sets being greater than a predetermined maximum number of disks per disk set, determining a plurality of candidate combinations of disks into disk sets; and
selecting a target combination from the plurality of candidate combinations, a first disk set of the target combination comprising at least a first subset of the first disk set corresponding to a first disk array, a second disk set of the target combination comprising at least a second subset of the second disk set corresponding to a second disk array, a number of disks in the first subset and a number of disks in the second subset being both equal to a first number and the disks in the first subset being different from the disks in the second subset, wherein selecting the target combination from the plurality of candidate combinations comprises:
selecting a plurality of intermediate combinations from the plurality of candidate combinations, a disk set of each of the plurality of intermediate combinations comprising at least a first subset for that intermediate combination, and a further disk set of the intermediate combination comprising at least a second subset for that intermediate combination;
calculating a first group of unavailable capacities for the respective first subsets for the plurality of intermediate combinations; and
calculating a second group of unavailable capacities for the respective second subsets for the plurality of intermediate combinations.
13. The computer program product according to claim 12 , wherein selecting the target combination from the plurality of candidate combinations further comprises:
determining the target combination from the plurality of intermediate combinations based on the first group of unavailable capacities and the second group of unavailable capacities to enable a sum of an unavailable capacity of the first group of unavailable capacities for the first subset for that target combination and an unavailable capacity of the second group of unavailable capacities for the second subset for that target combination to be smaller than or equal to a predetermined threshold.
14. The computer program product according to claim 13 , wherein calculating the first group of unavailable capacities comprises:
determining a minimum capacity from among respective predetermined capacities of a plurality of disks in the first subset for one of the plurality of intermediate combinations; and
determining an excess capacity in relation to the minimum capacity for each of the plurality of disks in the first subset for the one of the plurality of intermediate combinations;
determining an unavailable capacity for the first subset for the one of the plurality of intermediate combinations based on the excess capacity.
15. The computer program product according to claim 12 , wherein a number of disks other than the first subset in the first disk set of the target combination is greater than or equal to the first number and smaller than or equal to the predetermined maximum number of disks.
16. The computer program product according to claim 12 , wherein a number of disks contained in the second disk set for the target combination is equal to the first number.
17. The computer program product according to claim 12 , wherein the set of instructions, when carried out by computerized circuitry, further cause the computerized circuitry to:
in response to the number of the plurality of disks being smaller than or equal to the predetermined maximum number of disks, determine the plurality of disks as disks in the first disk set.