Patent application number | Description | Published |
20090313296 | METHOD AND APPARATUS FOR MANAGING STORAGE - The invention provides a method and apparatus for managing stored objects. The method includes providing an object management policy for stored objects, analyzing the object management policy to identify information required to execute the object management policy, acquiring the identified information from a protection repository for the stored objects, and executing the object management policy based on the acquired information to manage the stored objects. | 12-17-2009 |
20090313297 | METHOD AND APPARATUS FOR USING SELECTIVE ATTRIBUTE ACQUISITION AND CLAUSE EVALUATION FOR POLICY BASED STORAGE MANAGEMENT - The invention provides a method and apparatus for managing stored data objects. The method includes detecting involved attributes of stored data objects based on object management rules, determining expected data storage management costs for each possible order of attribute acquisition for the detected attributes, detecting an order of attribute acquisition that has a data storage management cost which is minimal or below a predetermined threshold, acquiring the attributes of the stored data objects based on the detected order of attribute acquisition, and executing an object management policy based on the acquired attributes to manage the stored objects at the low cost for object storage, attribute acquisition and policy evaluation. | 12-17-2009 |
20100250501 | STORAGE MANAGEMENT THROUGH ADAPTIVE DEDUPLICATION - One embodiment retrieves a first portion of a plurality of stored objects from at least one storage device. The embodiment further performs a base type deduplication estimation process on the first portion of stored objects. The embodiment still further categorizes the first portion of the plurality of stored objects into deduplication sets based on a deduplication relationship of each object of the plurality of stored objects with each of the estimated first plurality of deduplication chunk portions. The embodiment further combines deduplication sets into broad classes based on deduplication characteristics of the objects in the deduplication sets. The embodiment still further classifies a second portion of the plurality of stored objects into broad classes using classifiers. The embodiment further selects an appropriate deduplication approach for each categorized class. | 09-30-2010 |
20110055621 | DATA REPLICATION BASED ON CAPACITY OPTIMIZATION - A system and associated method for replicating data based on capacity optimization. A local node receives the data associated with a key. The local node within a local domain communicates with nodes of remote domains in a system through a communication network. Each domain has its own distributed hash table that partitions key space and assigns a certain key range to an owner node within the domain. For new data, the local node queries owner nodes of domains in the system progressively from the local domain to remote domains for a duplicate of the new data. Depending on a result returned by owner nodes and factors for replication strategies, the local node determines a replication strategy and records the new data in the local node pursuant to the replication strategy. | 03-03-2011 |
20110138391 | CONTINUOUS OPTIMIZATION OF ARCHIVE MANAGEMENT SCHEDULING BY USE OF INTEGRATED CONTENT-RESOURCE ANALYTIC MODEL - 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. | 06-09-2011 |
20110185233 | AUTOMATED SYSTEM PROBLEM DIAGNOSING - Embodiments of the invention relate to automated system problem diagnosing. An index is created with problem description information of previously diagnosed problems, a diagnosis for each problem, and a solution to each diagnosis. System states, traces and logs are extracted from a source system with a new problem. The problem diagnosis system generates problem description information of the new problem from the system states, traces and logs. Problem description information of the new problem is compared with problem description information in the problem description index. A search score is computed for each document in the problem description index. The search score is a measure of similarity between each document in the index and the description of the new problem. A matching score is assigned to each previously diagnosed problems based on the search score. The matching score is a measure of similarity between the new problem and each previously diagnosed problem. The system determines a diagnosis and solution of the new problem based on a diagnosis and solution of one of the previously diagnosed problems. | 07-28-2011 |
20110213508 | OPTIMIZING POWER CONSUMPTION BY DYNAMIC WORKLOAD ADJUSTMENT - 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. | 09-01-2011 |
20110295815 | Proactive Detection of Data Inconsistencies in a Storage System Point-in-Time Copy of Data - 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. | 12-01-2011 |
20110296237 | SELECTING A DATA RESTORE POINT WITH AN OPTIMAL RECOVERY TIME AND RECOVERY POINT - 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. | 12-01-2011 |
20120304182 | CONTINUOUS OPTIMIZATION OF ARCHIVE MANAGEMENT SCHEDULING BY USE OF INTEGRATED CONTENT-RESOURCE ANALYTIC MODEL - 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. | 11-29-2012 |
20120330895 | TRANSITIONING APPLICATION REPLICATION CONFIGURATIONS IN A NETWORKED COMPUTING ENVIRONMENT - 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. | 12-27-2012 |
20130006943 | HYBRID DATA BACKUP IN A NETWORKED COMPUTING ENVIRONMENT - 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”. A storage solution is then determined based on the set of storage configuration parameters. In general, the storage solution identifies at least one local storage resource and at least one remote storage resource (e.g., a cloud storage resource) for backing up the portions of the set of data that are unique to the set of data. Once the storage solution has been determined, the unique portions of the set of data will be stored in accordance therewith. | 01-03-2013 |
20130110793 | DATA DE-DUPLICATION IN COMPUTER STORAGE SYSTEMS | 05-02-2013 |
20130261826 | OPTIMIZING POWER CONSUMPTION BY DYNAMIC WORKLOAD ADJUSTMENT - 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. | 10-03-2013 |
20130290258 | TRANSITIONING APPLICATION REPLICATION CONFIGURATIONS IN A NETWORKED COMPUTING ENVIRONMENT - 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. | 10-31-2013 |
20130298131 | CONTINUOUS OPTIMIZATION OF ARCHIVE MANAGEMENT SCHEDULING BY USE OF INTEGRATED CONTENT-RESOURCE ANALYTIC MODEL - 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. | 11-07-2013 |
20140074794 | OPTIMIZING RESTORATION OF DEDUPLICATED DATA - 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. | 03-13-2014 |
20140223122 | MANAGING VIRTUAL MACHINE PLACEMENT IN A VIRTUALIZED COMPUTING ENVIRONMENT - 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. | 08-07-2014 |
20140244590 | HYBRID DATA BACKUP IN A NETWORKED COMPUTING ENVIRONMENT - 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”. A storage solution is then determined based on the set of storage configuration parameters. In general, the storage solution identifies at least one local storage resource and at least one remote storage resource (e.g., a cloud storage resource) for backing up the portions of the set of data that are unique to the set of data. Once the storage solution has been determined, the unique portions of the set of data will be stored in accordance therewith. | 08-28-2014 |
20140330795 | OPTIMIZING RESTORATION OF DEDUPLICATED DATA - 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. | 11-06-2014 |