Abstract: A mechanism is provided for optimizing object storage workflow. A category of a computational algorithm received from a user of a client device is identified, the category identifying a set of storage area network (SAN) features that are optimal for executing the computational algorithm. Features associated with a plurality of nodes in a plurality of infrastructures in an object storage architecture are searched for at least one node that has the set of features identified by the category of the computational algorithm. Responsive to identifying a node that has the set of features identified by the category of the computational algorithm, a determination is made as to whether resources associated with the node are immediately available. Responsive to the resources associated with the node being immediately available, the computational algorithm is issued to the node for execution.

Abstract: A first request may be received to write a first set of data to a first storage device of a first storage node. The first storage device may be capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node. It may be determined that a first token clash check does not need to occur for the first request. The first token clash check may include determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions. The one or more tokens may be a proxy for a set of data within one or more particular address ranges of the first storage device.

Abstract: A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. Moreover, the program instructions readable and/or executable by a processor to cause the processor to perform a method which includes: maintaining a heat map monitoring table on a per volume basis for a plurality of volumes which includes a heat count for each data block in the respective volume. A request to delete a first volume is received, and the data blocks in the first volume are depended on by one or more other volumes of the plurality of volumes are identified. The identified data blocks and corresponding heat counts are copied to the respective one or more other volumes, and a list which includes the identified data blocks and corresponding heat counts are sent to a controller.

Abstract: A computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

Abstract: Cache prefetching in offloaded data transfer (ODX) processes. A populate token command is received to initiate a copy offload operation. Responsive to receiving the populate token command, a cache of a data storage system in a storage area network environment is instructed to prefetch data in accordance with the populate token command and complete an offloaded read request. Responsive to determining that a write using token command is not received within a specified time duration, the prefetched data stored in the cache is evicted.

Abstract: A first request may be received to write a first set of data to a first storage device of a first storage node. The first storage device may be capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node. It may be determined that a first token clash check does not need to occur for the first request. The first token clash check may include determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions. The one or more tokens may be a proxy for a set of data within one or more particular address ranges of the first storage device.

Abstract: A network switch manager apparatus includes a bandwidth module, a resource module, a variance module, and an adjustment module. The bandwidth module determines a percentage of bandwidth allocated to one of a plurality of protocols at an enhanced transmission selection (ETS) enabled network switch. The resource module determines a number of resources allocated for a plurality of virtual machines, the number of resources classified between the plurality of protocols. The variance module compares the percentage of bandwidth and the number of resources to determine a variance. The adjustment module adjusts the percentage of bandwidth allocated to the one of the plurality of protocols based on the variance.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed in a multi-device file system. At least one virtual device out of a volume set is designated as not subject to a deduplication operation.

Abstract: A mechanism is provided in a data processing system for asynchronous replication. The mechanism creates a record in a write log in a host computing device for a write command and marking the record as uncommitted. The mechanism maintains a copy of data to be written by the write command at the host computing device. The mechanism issues the write command from the host computing device to a primary storage controller at the primary storage site. Responsive to receiving an acknowledgement from the primary storage controller that the data have been written to the primary storage site, the mechanism marks the record as unreplicated. Responsive to receiving an acknowledgement from the primary storage controller that the data have been replicated to a secondary storage site, the mechanism erases the record in the write log and deleting the copy of data.

Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. At least one virtual device out of a volume set is designated as not subject to a deduplication operation.

Abstract: A computer-implemented method, according to one embodiment, includes: maintaining a heat map monitoring table on a per volume basis for a plurality of volumes in a multi-tier data storage architecture, where the heat map monitoring table includes a heat count for each data block in the respective volume. The computer-implemented method further includes: receiving a request to delete a first volume of the plurality of volumes, identifying which data blocks in the first volume are depended on by one or more other volumes of the plurality of volumes, copying the identified data blocks and the corresponding heat counts to the respective one or more other volumes, and sending a list which includes the identified data blocks and the corresponding heat counts to a controller. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Methods and systems for storage network tiering are provided. One method includes receiving input/output (I/O) requests from a set of client devices via one of a plurality of communication paths and performing I/O operations on data in one or more storage devices based on corresponding I/O requests. The method further includes determining locations storing each data set in the one or more storage devices and transmitting, to the set of client devices, recommendations of a communication path in the plurality of communication paths for transmitting subsequent I/O requests that access a particular data set based on the location storing the particular data set. Systems and computer program products for performing the above method are also provided.

Abstract: A computing system includes a computer in communication with a tiered storage system. The computing system identifies a set of data transferring to a storage tier within the storage system. The computing system identifies a program to which the data set is allocated and determines to increase or reduce resources of the computer allocated to the program, based on the set of data transferring to the storage tier. The computing system discontinues transferring the set of data to the storage tier if a resource allocated to the program cannot be increased.

Abstract: A mechanism is provided for allocating data storage utilizing virtual machine resource allocation. Information pertaining to resource allocation to a set of partitions in a logically partitioned data processing system is gathered and analyzed to generate resource allocation based storage information for each partition in the set of partitions in the logically partitioned data processing system. For each partition in the set of partitions in the logically partitioned data processing system, a storage partition is generated in one or more faster storage tiers at a ratio according to the resource allocation based storage information associated with that partition. For each partition in the set of partitions in the logically partitioned data processing system, data is migrated between one or more slower storage tiers and the one or more faster storage tiers utilizing associated storage partitions in the one or more fastest storage tiers.

Abstract: Cache prefetching in offloaded data transfer (ODX) processes. A populate token command is received to initiate a copy offload operation. Responsive to receiving the populate token command, a cache of a data storage system in a storage area network environment is instructed to prefetch data in accordance with the populate token command and complete an offloaded read request. Responsive to determining that a write using token command is not received within a specified time duration, the prefetched data stored in the cache is evicted.

Abstract: Cache prefetching in offloaded data transfer (ODX) processes. A populate token command is received to initiate a copy offload operation. Responsive to receiving the populate token command, a cache of a data storage system in a storage area network environment is instructed to prefetch data in accordance with the populate token command and complete an offloaded read request. Responsive to determining that a write using token command is not received within a specified time duration, the prefetched data stored in the cache is evicted.

Abstract: Whether a replication relationship is established between a first and a second storage device is determined. If it is determined that the replication relationship is established between the first and second storage device, then whether data in the first region of the first storage device has changed since a previously completed asynchronous data replication process is determined. If the data in the first region of the first storage device has changed since the previously completed asynchronous data replication process, then whether the changed data in the first storage device is data copied from the second region of the first storage device is determined. If the changed data in the first region of the first storage device is data copied from the second region of the first storage device, then data from the second region of the second storage device is replicated to the first region of the second storage device.

Abstract: Whether a replication relationship is established between a first and a second storage device is determined. If it is determined that the replication relationship is established between the first and second storage device, then whether data in the first region of the first storage device has changed since a previously completed asynchronous data replication process is determined. If the data in the first region of the first storage device has changed since the previously completed asynchronous data replication process, then whether the changed data in the first storage device is data copied from the second region of the first storage device is determined. If the changed data in the first region of the first storage device is data copied from the second region of the first storage device, then data from the second region of the second storage device is replicated to the first region of the second storage device.

Abstract: Whether a replication relationship is established between a first and a second storage device is determined. If it is determined that the replication relationship is established between the first and second storage device, then whether data in the first region of the first storage device has changed since a previously completed asynchronous data replication process is determined. If the data in the first region of the first storage device has changed since the previously completed asynchronous data replication process, then whether the changed data in the first storage device is data copied from the second region of the first storage device is determined. If the changed data in the first region of the first storage device is data copied from the second region of the first storage device, then data from the second region of the second storage device is replicated to the first region of the second storage device.

Abstract: For a cache in which a plurality of frequently accessed data segments are temporarily stored, reference count information of the plurality of data segments, in conjunction with least recently used (LRU) information, is used to determine a length of time to retain the plurality of data segments in the cache according to a predetermined weight, where notwithstanding the LRU information, those of the plurality of data segments having a higher reference counts are retained longer than those having lower reference counts.