Storage system and data management method of storage system

1. A storage system having a plurality of storage apparatuses in which one or a plurality of logical volumes are provided,

wherein, based on data information of data obtained through the generation of a request to write to a logical volume in the storage system, one storage apparatus among the plurality of storage apparatuses calculates, for a plurality of combinations of storage apparatus and logical volume in the storage system, a data capacity when duplicate data is removed for each of the storage apparatuses, calculates the total capacity of the whole storage system as the summation of the calculated data capacities, and performs optimal arrangement arithmetic processing to output information indicating a combination with the smallest total capacity among the plurality of combinations,

wherein each of the plurality of storage apparatuses:

stores, as hash information for each logical volume, a block number enabling identification of a block which is a unit for storing data and a hash value of data written to the block, upon storing data according to a request from a host apparatus to write to a logical volume,

acquires hash values stored by other storage apparatuses, compares, for each logical volume, the acquired hash values and hash values stored by its own storage apparatus, calculates, as data information pertaining to logical volumes of its own storage apparatus, data capacities of matching hash values, and transmits the calculated data information to the one storage apparatus, and

wherein the one storage apparatus calculates the total of matching data capacities between logical volumes arranged in the storage apparatuses as a data capacity when duplicate data is removed.

2. The storage system according to claim 1 ,

wherein each of the plurality of storage apparatuses:

transmits the stored hash value to the one storage apparatus, and

wherein the one storage apparatus compares the received hash value with the logical volumes arranged in the storage apparatus, and calculates data capacities of matching hash values as a data capacity when duplicate data is removed.

3. The storage system according to claim 2 ,

wherein the one storage apparatus selects logical volumes, in descending order of data capacity, which match one logical volume among the plurality of logical volumes as a plurality of logical volumes to be arranged in the storage apparatus of the storage system, and determines a combination of storage apparatus and logical volume in the storage system.

4. The storage system according to claim 1 ,

wherein the one storage apparatus selects logical volumes, in descending order of data capacity, which match one logical volume among the plurality of logical volumes as a plurality of logical volumes to be arranged in the storage apparatus of the storage system, and determines a combination of storage apparatus and logical volume in the storage system.

5. The storage system according to claim 1 ,

wherein each of the plurality of storage apparatuses has a program that performs the optimal arrangement arithmetic processing, acquires identification information and fault states of the other storage apparatuses in the storage system, determines whether or not the identification information of its own storage apparatus is the smallest among the storage apparatuses which are not in a fault state, and, when it is determined that its identification information is the smallest, executes the optimal arrangement arithmetic processing program and performs the optimal arrangement arithmetic processing.

6. The storage system according to claim 1 ,

wherein each of the plurality of storage apparatuses:

is configured comprising a plurality of redundant storage controllers, and

stores the hash information in a storage area to which all the storage controllers included in its own storage apparatus are capable of referring,

wherein each of the plurality of storage controllers has a program that performs the optimal arrangement arithmetic processing, and

wherein, in each of the plurality of storage apparatuses, one storage controller among the storage controllers included in its own storage apparatus acquires identification information and fault states of the other storage apparatuses in the storage system, determines whether or not the identification information of its own storage apparatus is the smallest among the storage apparatuses which are not in a fault state, and, when it is determined that its identification information is the smallest, executes the optimal arrangement arithmetic processing program and performs the optimal arrangement arithmetic processing.

7. The storage system according to claim 1 ,

wherein the one storage apparatus indicates a logical volume migration destination for the plurality of storage apparatuses according to the results of the optimal arrangement arithmetic processing.

8. The storage system according to claim 1 ,

wherein the one storage apparatus stores, as chronological information, the data information, and time information indicating the time the data information is calculated, and

wherein, in the optimal arrangement arithmetic processing, the one storage apparatus finds an approximation curve from the chronological information, predicts data information of a predetermined time in the future, and by using the predicted data information, calculates, for a plurality of combinations of storage apparatus and logical volume in the storage system, a data capacity when duplicate data is removed for each storage apparatus, calculates the total of the calculated data capacities as the total capacity of the whole storage system, and performs the optimal arrangement arithmetic processing to output information indicating the combination with the smallest total capacity among the plurality of combinations.

9. A data management method of a storage system having a plurality of storage apparatuses in which one or a plurality of logical volumes are provided, the data management method comprising:

a first step in which, based on data information of data obtained through the generation of a request to write to a logical volume in the storage system, one storage apparatus among the plurality of storage apparatuses calculates, for a plurality of combinations of storage apparatus and logical volume in the storage system, a data capacity when duplicate data is removed for each of the storage apparatuses;

a second step of calculating the total capacity of the whole storage system as the summation of the calculated data capacities; and

a third step of performing optimal arrangement arithmetic processing to output information indicating a combination with the smallest total capacity among the plurality of combinations,

wherein each of the plurality of storage apparatuses:

stores, as hash information for each logical volume, a block number enabling identification of a block which is a unit for storing data and a hash value of data written to the block, upon storing data according to a request from a host apparatus to write to a logical volume,

acquires hash values stored by other storage apparatuses, compares, for each logical volume, the acquired hash values and hash values stored by its own storage apparatus, calculates, as data information pertaining to logical volumes of its own storage apparatus, data capacities of matching hash values, and transmits the calculated data information to the one storage apparatus, and

wherein the one storage apparatus calculates the total of matching data capacities between logical volumes arranged in the storage apparatuses as a data capacity when duplicate data is removed.