Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks is utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that are serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: Embodiments of the present invention provide an approach for providing non-disruptive transitioning of application replication configurations and proactive analysis of possible error scenarios. Specifically, under embodiments of the present invention, a common integration model (CIM)-compatible representation of a system replication plan is provided in a computer data structure. Based on the representation, a hierarchical tree data structure having a set of nodes is created. A set of system configuration updates pertaining to the set of nodes are then classified (e.g., based upon the type of configuration update). Once the set of nodes has been classified, the set of nodes may then be analyzed to determine if any nodes of the set are isomorphic. If so, the plan can be modified accordingly. In any event, the replication plan (or modified replication plan) may then be implemented.

Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: Embodiments of the present invention provide a hybrid (e.g., local and remote) approach for data backup in a networked computing environment (e.g., a cloud computing environment). In a typical embodiment, a set of storage configuration parameters corresponding to a set of data to be backed up is received and stored in a computer data structure. The set of storage configuration parameters can comprise at least one of the following: a recovery time objective (RTO), a recovery point objective (RPO), and a desired type of protection for the set of data. Regardless, the set of data is compared to previously stored data to identify at least one of the following: portions of the set of data that have commonality with the previously stored data; and portions of the set of data that are unique to the set of data (i.e., not in common with any of the previously stored data). The above-described process is referred to herein as “de-duplication”.

Abstract: Embodiments of the invention relate to testing a storage system point-in-time copy of data for consistency. An aspect of the invention includes receiving system and application event information from systems and applications associated with point-in-time copies of data. The system and application event information is associated with each of point-in-time copies of data. At least one point-in-time copy of data is selected for testing. The system and application event information is compared with inconsistency classes to determine tests for testing the point-in-time copy of data. The point-in-time copy of data is tested.

Abstract: A method for determining that first and second virtual machines, that currently execute in first and second host computing systems, respectively, should both execute within a same host computing system. The method includes determining that the first and second virtual machines have accessed same data more often than a third and fourth virtual machines have accessed said same data. Based in part on this determination, the method includes determining that the first and second virtual machines should execute in a same host computing system having a same cache memory for both the first and second virtual machines and that the third and fourth virtual machines should execute on one or more different host computing systems than said same host computing system.

Abstract: Embodiments of the present invention provide an approach that utilizes discrete event simulation to quantitatively analyze the reliability of a modeled de-duplication system in a computer storage environment. In addition, the approach described herein can perform such an analysis on systems having heterogeneous data stored on heterogeneous storage systems in the presence of primary faults and their secondary effects due to de-duplication. In a typical embodiment, data de-duplication parameters and a hardware configuration are received in a computer storage medium. A data de-duplication model is then applied to a set of data and to the data de-duplication parameters, and a hardware reliability model is applied to the hardware configuration. Then a set (at least one) of discrete events is simulated based on the data de-duplication model as applied to the set of data and the data de-duplication parameters, and the hardware reliability model as applied to the hardware configuration.

Abstract: Embodiments of the present invention provide a hybrid (e.g., local and remote) approach for data backup in a networked computing environment (e.g., a cloud computing environment). In a typical embodiment, a set of storage configuration parameters corresponding to a set of data to be backed up is received and stored in a computer data structure. The set of storage configuration parameters can comprise at least one of the following: a recovery time objective (RTO), a recovery point objective (RPO), and a desired type of protection for the set of data. Regardless, the set of data is compared to previously stored data to identify at least one of the following: portions of the set of data that have commonality with the previously stored data; and portions of the set of data that are unique to the set of data (i.e., not in common with any of the previously stored data). The above-described process is referred to herein as “de-duplication”.

Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: A method and associated system for continuously optimizing data archive management scheduling. A flow network is modeled. The flow network represents data content, software programs, physical devices, and communication capacity of the archive management system in various levels of vertices such that an optimal path in the flow network from a task of at least one archive management task to a worker program of the archive management system represents an optimal initial schedule for the worker program to perform the task.

Abstract: Embodiments of the present invention provide an approach for providing non-disruptive transitioning of application replication configurations and proactive analysis of possible error scenarios. Specifically, under embodiments of the present invention, a common integration model (CIM)-compatible representation of a system replication plan is provided in a computer data structure. Based on the representation, a hierarchical tree data structure having a set of nodes is created. A set of system configuration updates pertaining to the set of nodes are then classified (e.g., based upon the type of configuration update). Once the set of nodes has been classified, the set of nodes may then be analyzed to determine if any nodes of the set are isomorphic. If so, the plan can be modified accordingly. In any event, the replication plan (or modified replication plan) may then be implemented.

Abstract: A method and system for optimizing power consumption of a data center by dynamic workload adjustment. At least one candidate workload solution for the data center is generated. Each candidate workload solution represents a respective application map that specifies a respective workload distribution among application programs of the data center. Workload of the data center is dynamically adjusted from a current workload distribution to an optimal workload solution. The optimal workload solution is a candidate workload solution of the at least one candidate workload solution having a lowest sum of a respective power cost and a respective migration cost. Dynamically adjusting the workload of the data center includes: estimating a respective overall cost of each candidate workload solution, selecting the optimal workload solution that has a lowest overall cost as determined from the estimating, and transferring the optimal workload solution to devices of a computer system for deployment.

Abstract: A system and associated method for continuously optimizing data archive management scheduling. A job scheduler receives, from an archive management system, inputs of task information, replica placement data, infrastructure topology data, and resource performance data. The job scheduler models a flow network that represents data content, software programs, physical devices, and communication capacity of the archive management system in various levels of vertices according to the received inputs. An optimal path in the modeled flow network is computed as an initial schedule, and the archive management system performs tasks according to the initial schedule. The operations of scheduled tasks are monitored and the job scheduler produces a new schedule based on feedbacks of the monitored operations and predefined heuristics.

Abstract: Embodiments of the present invention provide an approach for providing non-disruptive transitioning of application replication configurations and proactive analysis of possible error scenarios. Specifically, under embodiments of the present invention, a common integration model (CIM)-compatible representation of a system replication plan is provided in a computer data structure. Based on the representation, a hierarchical tree data structure having a set of nodes is created. A set of system configuration updates pertaining to the set of nodes are then classified (e.g., based upon the type of configuration update). Once the set of nodes has been classified, the set of nodes may then be analyzed to determine if any nodes of the set are isomorphic. If so, the plan can be modified accordingly. In any event, the replication plan (or modified replication plan) may then be implemented.

Abstract: A system and associated method for optimizing power consumption of a data center by dynamic workload adjustment. A current workload distribution of the data center is shifted to an optimal workload solution that provides acceptable level of service with the least amount of power consumption. The sum of power cost and migration cost that corresponds to the optimal workload solution is the lowest among all sums that correspond to respective candidate workload solutions. The power cost is determined by a maximum temperature of the data center and accompanying cooling cost for each candidate workload solution. The migration cost is determined by performance degradation that occurs during shifting a workload distribution of the data center from the current workload distribution to each candidate workload solution.

Abstract: Embodiments of the invention relate to selecting a data restore point with an optimal recovery time and recovery point. An exemplary embodiment includes generating a problem search criterion for an entity with corrupted data. Dependencies relied on by the entity to function are determined. At least one event signature match is found that comprises information for an event being logged in a event log, and is associated with the dependencies. At least one data restore point created prior to an occurrence of a particular event in the at least one event signature match is selected. The particular event having caused the data to be corrupted. The at least one data restore point is selected to restore data to a storage system with the corrupted data.

Abstract: Embodiments of the present invention provide an approach that utilizes discrete event simulation to quantitatively analyze the reliability of a modeled de-duplication system in a computer storage environment. In addition, the approach described herein can perform such an analysis on systems having heterogeneous data stored on heterogeneous storage systems in the presence of primary faults and their secondary effects due to de-duplication. In a typical embodiment, data de-duplication parameters and a hardware configuration are received in a computer storage medium. A data de-duplication model is then applied to a set of data and to the data de-duplication parameters, and a hardware reliability model is applied to the hardware configuration. Then a set (at least one) of discrete events is simulated based on the data de-duplication model as applied to the set of data and the data de-duplication parameters, and the hardware reliability model as applied to the hardware configuration.

Abstract: A system and method for delivering business intelligence content to one or more mobile devices from multiple source reporting systems comprise a dynamic adaptor utilizing a networking protocol. The dynamic adaptor comprises at least one source specific adaptor that abstracts interaction with the at least one source reporting system and generates the result in a common format as metadata. A metadata manager is employed for storing, processing, and retrieving an information describing the at least one metadata from the at least one source specific adaptor. A presentation engine combines the metadata with the information from the at least one source specific adaptor that corresponds to an object selected by a user. The common report metadata is utilized to retrieve the at least one information from the metadata manager and to selectively combine with the metadata when the user requests for the previously retrieved information.

Abstract: Embodiments of the present invention provide a hybrid (e.g., local and remote) approach for data backup in a networked computing environment (e.g., a cloud computing environment). In a typical embodiment, a set of storage configuration parameters corresponding to a set of data to be backed up is received and stored in a computer data structure. The set of storage configuration parameters can comprise at least one of the following: a recovery time objective (RTO), a recovery point objective (RPO), and a desired type of protection for the set of data. Regardless, the set of data is compared to previously stored data to identify at least one of the following: portions of the set of data that have commonality with the previously stored data; and portions of the set of data that are unique to the set of data (i.e., not in common with any of the previously stored data). The above-described process is referred to herein as “de-duplication”.

Abstract: Embodiments of the present invention provide an approach for providing non-disruptive transitioning of application replication configurations and proactive analysis of possible error scenarios. Specifically, under embodiments of the present invention, a common integration model (CIM)-compatible representation of a system replication plan is provided in a computer data structure. Based on the representation, a hierarchical tree data structure having a set of nodes is created. A set of system configuration updates pertaining to the set of nodes are then classified (e.g., based upon the type of configuration update). Once the set of nodes has been classified, the set of nodes may then be analyzed to determine if any nodes of the set are isomorphic. If so, the plan can be modified accordingly. In any event, the replication plan (or modified replication plan) may then be implemented.