Abstract: Provided are a computer program product, computer system, and method for smart selection of a storage module to be excluded when a connection between two storage modules is broken. An indication is received from a first storage module that a connection between the first storage module and a second storage module is broken. In response to determining that the second storage module is accessible, values of exclusion criteria for the first storage module are determined and summed to identify a first exclusion total. Then, values of exclusion criteria for the second storage module are determined and summed to identify a second exclusion total. In response to determining that the first exclusion total exceeds the second exclusion total, the second storage node is excluded from the cluster. In response to determining that the second exclusion total exceeds the first exclusion total, the first storage node is excluded from the cluster.

Abstract: Provided are a computer program product, system, and method for generating a configuration page for rendering in a graphical user interface (GUI) for managing provisioning of storage resources in a storage system. A determination is made of allocation commitment certainties for virtual storage ranges to allocate from the storage system based on physical capacity in the storage system and an estimated data reduction rate. Each of the allocation commitment certainties indicates a likelihood that a corresponding of the virtual storage ranges will be available for allocation in the storage system. Visual representation of a plurality of user selectable storage spaces indicating the allocation commitment certainties for the virtual storage ranges in the user selectable storage spaces are rendered in the configuration page. A user selection graphic that when selected provisions a selected of the user selectable storage spaces in the storage system is rendered in the configuration page.

Abstract: Provided are a computer program product, system, and method for distributed global data vaulting in a grid of server computers. At each of the server computers, it is determined that there is a system shutdown. For each data element at that server computer, a list of one or more vault devices at other server computers is retrieved from a vault distribution table, and the data element is dumped to the one or more vault devices at the other server computers.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk. The rolling hash values are used to contribute to the calculation of the similarity search values and to the calculation of the boundaries of the digest blocks.

Abstract: For digest retrieval based on similarity search in deduplication processing in a data deduplication system using a processor device in a computing environment, input data is partitioned into fixed sized data chunks. Similarity elements and digest block boundaries and digest values are calculated for each of the fixed sized data chunks. Matching similarity elements are searched for in a search structure containing the similarity elements for each of the fixed sized data chunks in a repository of data. Positions of similar data are located in the repository. The positions of the similar data are used to locate and load into the memory stored digest values and corresponding stored digest block boundaries of the similar data in the repository. The digest values and the corresponding digest block boundaries of the input data are matched with the stored digest values and the corresponding stored digest block boundaries to find data matches.

Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances.

Abstract: A calculated factoring ratio is determined as a weighted ratio of current nominal data to physical data. A maximal nominal estimated space in the computing storage environment is calculated. A remaining space, defined as the maximal nominal estimated space minus a current nominal space in the computing storage environment, is calculated. Data replication operations are accepted and stored in the computing storage environment if the remaining space is below a predetermined threshold of space for backup operations.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk. The rolling hash values are used to contribute to the calculation of the similarity search values and to the calculation of the boundaries of the digest blocks.

Abstract: A calculated factoring ratio is determined as a weighted ratio of current nominal data to physical data. A maximal nominal estimated space in the computing storage environment is calculated. A remaining space, defined as the maximal nominal estimated space minus a current nominal space in the computing storage environment, is calculated. Data replication operations are accepted and stored in the computing storage environment if the remaining space is below a predetermined threshold of space for backup operations.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk.

Abstract: A calculated factoring ratio is determined as a weighted ratio of current nominal data to physical data based on at least one storage capacity threshold and a used storage space currently physically consumed by one of backup and replication data. A maximal nominal estimated space in the computing storage environment is calculated. A remaining space, defined as the maximal nominal estimated space minus a current nominal space in the computing storage environment, is calculated.

Abstract: Pursuant to execution of a predetermined failback policy, if a storage device is not preexistent in a source storage system operable in the computing environment, and an owner of the storage device is one of a DR storage system and a storage system having previously withdrawn from a replication grid, and the DR storage system has authorization to transfer ownership of the storage device by a replacement operation, and an instance of the storage device is replicated to the source storage system to generate a replicated instance of the storage device on the source storage system.

Abstract: A deduplication storage capacity is estimated as a function of an expected deduplication ratio, the expected deduplication ratio being a combined average of a current deduplication ratio and a configured deduplication ratio, the current deduplication ratio depending on the data currently stored in the deduplication storage, and the configured deduplication ratio being an estimate made at a configuration stage of the deduplication computing storage environment.

Abstract: Exemplary method, system, and computer program product embodiments for changing ownership of cartridges, such as virtual cartridges between remotely located virtual tape libraries, are provided. In one embodiment, by way of example only, processes and protocols for the changing ownership of the cartridges are controlled from a primary location to a secondary location. The production site is moved for the cartridges. The ownership of the cartridges is waived. Access is allowed to the cartridges. Additional data is written and replicated using resources of the cartridges.

Abstract: Various embodiments for replicating deduplicated data using a processor device are provided. A block of the deduplicated data, created in a source repository, is assigned a global block identifier (ID) unique in a grid set inclusive of the source repository. The global block ID is generated using at least one unique identification value of the block, a containing grid of the grid set, and the source repository. The global block ID is transmitted from the source repository to a target repository. If the target repository determines the global block ID is associated with an existing block of the deduplicated data located within the target repository, the block is not transmitted to the target repository during a subsequent replication process.

Abstract: Exemplary system, and computer program product embodiments for changing ownership of cartridges, such as virtual cartridges between remotely located virtual tape libraries, are provided. In one embodiment, by way of example only, processes and protocols for the changing ownership of the cartridges are controlled from a primary location to a secondary location. The production site is moved for the cartridges. The ownership of the cartridges is waived. Access is allowed to the cartridges. Additional data is written and replicated using resources of the cartridges.

Abstract: For digest retrieval based on similarity search in deduplication processing in a data deduplication system using a processor device in a computing environment, input data is partitioned into fixed sized data chunks. Similarity elements and digest block boundaries and digest values are calculated for each of the fixed sized data chunks. Matching similarity elements are searched for in a search structure containing the similarity elements for each of the fixed sized data chunks in a repository of data. Positions of similar data are located in the repository. The positions of the similar data are used to locate and load into the memory stored digest values and corresponding stored digest block boundaries of the similar data in the repository. The digest values and the corresponding digest block boundaries of the input data are matched with the stored digest values and the corresponding stored digest block boundaries to find data matches.

Abstract: For efficient calculation of both similarity search values and boundaries of digest blocks in data deduplication, input data is partitioned into chunks, and for each chunk a set of rolling hash values is calculated. A single linear scan of the rolling hash values is used to produce both similarity search values and boundaries of the digest blocks of the chunk.

Abstract: Visibility of a data storage entity on a first storage system is switched to a replicated data storage entity on a second storage system. Data from the data storage entity is replicated from the first storage system to the second storage system using a common serial number. The data storage entity is hidden from the first storage system by concealing the common serial number. An ejection of the data storage entity from the first storage system is automated, and the replicated data storage entity is introduced to the second storage system.

Abstract: Deduplicated data is packed in a self-contained deduplicated repository having unique data blocks with each being referenced by a globally unique identifier (GUID). The self-contained deduplicated repository has information regarding both deduplicated data files and the unique data blocks of each of the deduplicated data files and a master GUID list containing a location of each of the unique data blocks.