Abstract: A computer-implemented method, according to one embodiment, includes: receiving a data volume having data from multiple tenants therein; separating data in the data volume into objects using tenant identifiers from metadata corresponding to portions of the data, wherein each object corresponds to a respective tenant; and storing the objects in object storage. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A computer program product is provided for auditing data in object storage. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions executable by a processor to cause the processor to:send, by the processor, an object to an object storage system. A directive to audit the object is also sent to the object storage system by the processor. Furthermore, one or more additional directives are sent to the object storage system by the processor. Each of the one or more additional directives are independently selected from the group consisting of: a feedback directive to obtain feedback regarding a progress and/or a status of the audit; and a control directive to start, pause, or stop the audit.

Abstract: A computer program product is provided for auditing data in object storage. The computer program product comprises a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by an object storage system to cause the object storage system to receive a directive to audit an object, and audit the object based on the directive. Additionally, the program instructions are executable by the object storage system to cause the object storage system to generate a result of the audit of the object.

Abstract: A distributed node service management system utilizes multiple existing processor nodes of a distributed computing system, in support of the primary data processing functions of the distributed computing system. The distributed node service management system coordinates and manages service functions on behalf of processor nodes of the distributed computing system. Other features and aspects may be realized, depending upon the particular application.

Abstract: A computer-implemented method for indexing metadata which corresponds to data stored in a storage system, according to one embodiment, includes: identifying a subset of metadata stored in a first data store to archive in response to determining that an amount of metadata stored in the first data store has reached a threshold, identifying an index for storing information about the subset of the metadata, executing a sort operation on the subset of the metadata, generating index information corresponding to the subset of the metadata, writing the subset of the metadata to an archive medium, and recording the index information in the identified index. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Changes in a multi-RAID configuration to metadata of a source production volume in a source RAID are monitored since taking a most recent FC backup on the source production volume. The incremental copies of the metadata are stored on a target production volume in a target RAID. The source RAID is used to serve as a storage for the source production volume and also serve as a FC backup of the target production volume residing on the target RAID for creating a dual purpose for the multi-RAID configuration.

Abstract: Exemplary embodiments for deploying code in a computing sysplex environment are provided. In one embodiment, by way of example only, a system-wide trending mechanism is applied. At least one of an idle time and a low Central Processing Unit (CPU) utilization time of one system in the sysplex environment is matched with an estimated deployment time obtained from at least one of a latest measured period of time and a calculated time trend. A system-wide coordinating mechanism is applied. A staggered code deployment operation is recommended for at least one node of the system at an optimum system time generated from the matching.

Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.

Abstract: A method for scheduling data services in a heterogeneous storage environment is disclosed. In one embodiment, such a method includes instrumenting, in a heterogeneous storage environment, each of a plurality of storage systems to generate events when operations are performed thereon. The events are detected and indexed in a single namespace. These events may then be analyzed to generate a statistical model of I/O activity occurring in the heterogeneous storage environment over a period of time. From the statistical model, the method determines periods of reduced I/O workload across the heterogeneous storage environment. The method then schedules data services to occur during these periods of reduced I/O workload. A corresponding system and computer program product are also disclosed.

Abstract: Methods, systems, and computer program product embodiments for cataloging data in a backup storage environment, by a processor device, are provided. In a storage system using tape library data replication between an originating site and one or more backup sites, data catalog data is replicated between the originating site and the backup site such that replicated data moved from the originating site to the backup site is placed into a catalog duplicative of the originating site.

Abstract: For calculating a deployment risk is disclosed, a processor generates a Software Defined Storage (SDS) solution for an SDS deployment. The processor further calculates a deployment risk for the SDS solution using a trade-off analytics function. In response to the deployment risk not exceeding a risk threshold, the processor deploys the SDS solution.

Abstract: In one embodiment, a method includes receiving, at a centralized index operating in a cloud environment via a messaging bus, first events spawned by a first processor managing an object store accessible via the cloud environment. The method also includes receiving, at the centralized index, second events spawned by a second processor managing an archival store accessible via the cloud environment. Also, the method includes normalizing metadata in the first and second events. Moreover, the method includes indexing and storing the metadata in the centralized index. The object store and the archival store operate in different object subsystems of the cloud environment. Other systems, methods, and computer program products are described for managing import, export, and copy of data within a public tiered object storage environment in accordance with more embodiments.

Abstract: Embodiments for exchanging data information packets, by a processor device, include writing an Internet Protocol (IP) information unit received by a host node executing a Fibre Connection (FICON) software library to a transport layer by converting the IP information unit to FICON payload and placing the FICON payload into a shared memory space of the host node; and transmitting data including the IP information unit to a target node by accessing the FICON payload in the shared memory by a FICON adapter of the host node and transferring the FICON payload to the target node over a FICON network.

Abstract: Methods, systems, and computer program product embodiments for exchanging data information packets, by a processor device, include receiving an Internet Protocol (IP) information unit by a host node executing a Fibre Connection (FICON) software library; writing the IP information unit to a transport layer; and transmitting data including the IP information unit to a target node over a FICON network.

Abstract: Embodiments for optimized deduplicated object storage system by one or more processors. An uncompressed and non-deduplicated copy of an object may be stored on a node in a distributed object storage system and one or more compressed and deduplicated copies of the uncompressed and non-deduplicated copy of the object may be distributed on one or more alternative nodes in the distributed object storage system.

Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.

Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.

Abstract: A method, executed by a computer, includes determining an access metric, an input/output operations per second (IOPs) metric, and a size metric for each data target of a plurality of data targets, ranking the plurality of data targets according to the access metric of each data target, assigning each data target to a storage pool of a plurality of storage pools according to the IOPs metric and the size metric of the data target. A computer system and computer program product corresponding to the above method are also disclosed herein.

Abstract: A method, executed by a computer, includes determining an access metric, an input/output operations per second (IOPs) metric, and a size metric for each data target of a plurality of data targets, ranking the plurality of data targets according to the access metric of each data target, assigning each data target to a storage pool of a plurality of storage pools according to the IOPs metric and the size metric of the data target. A computer system and computer program product corresponding to the above method are also disclosed herein.

Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.