International Business Machines Corporation

Umesh Deshpande

Sangeetha Seshadri

Paul Henri Muench

Nicholas Linck

Wayne A Sawdon

Vasily Tarasov

Priyaranjan Behera

Wilfred Edmund Plouffe, Jr

Thanh Tan Pham

Sandeep R Patil

Robert Michael Rees

Aayush Gupta

Mohit Saxena

Travis Janssen

Binayak Dutta

Yuquan Shan

Chetan Sharma

A computer-implemented method (CIM), according to one embodiment, includes simulating placement of a volume group on a first potential target storage system, and determining a first performance limit for the first potential target storage system based on the simulating. The method further includes predicting a duration the first potential target storage system can host the volume group without performance degradation, based on the first performance limit, and outputting a notification to a customer device, where the notification includes an indication of the predicted duration. A computer program product (CPP), according to another embodiment, includes a set of one or more computer-readable storage media, and program instructions, collectively stored in the set of one or more storage media, for causing a processor set to perform the foregoing method.

Performance-based migration for a volume group

An embodiment for a method of cost-aware tiering for data storage. The embodiment may detect data to be stored in one or more storage systems and gathering access and usage information. The embodiment may maintain a first data structure including periods of activity below a defined threshold for the detected data, and a common data structure to identify and track application-wide data patterns. The embodiment may gather static pricing information and context pricing information for the one or more storage systems and calculate a tiering threshold corresponding to a continuous period of activity below a second defined threshold required for which local storage costs exceed a tiering cost. The embodiment may calculate for inactive data segments, probabilities of the inactive data segments remaining inactive for a duration that exceeds the calculated tiering threshold. The embodiment may calculate a risk score and generate a tiering list for storing the data.

Cost-aware tiering for data storage

A computer-implemented method, a computer system and a computer program product efficiently select restore points in a continuous data protection environment. The method includes receiving log entries that include restore points that correspond to data stored on nodes in the continuous data protection environment. The method also includes identifying an interesting restore point from the log entries. The method further includes grouping the interesting restore point for recovery based on one or more of a confidence score and a restore time. In addition, the method includes loading the group of interesting restore points on available nodes in the continuous data protection environment. The method also includes determining whether the data corresponding to each interesting restore point in the group is valid using a validation function. Lastly, the method includes discarding the interesting restore point when the data corresponding to the interesting restore point is not valid.

Efficient recovery in continuous data protection environments

Technology for identifying relevant data (also called 'data of interest') for applying a machine logic based rule and for increasing the frequency of making backups (for example, snapshots) of the relevant data.

Intelligent backup engine for data freshness

A computer-implemented method according to one embodiment includes creating a log of one or more events occurring during a performance of continuous data protection (CDP) for an instance of data; in response to identifying a conclusion of the performance of CDP for the instance of data, determining a value for the one or more events within the log; and conditionally creating and storing a snapshot of the instance of data, based on a comparison of the value for the one or more events to a predetermined threshold.

Performing conditional snapshot creation during continuous data protection age-out

A computer-implemented method according to one embodiment includes retrieving details of a data backup system; determining whether a first data backup operation will complete within the data backup system before a second data backup operation is initiated within the data backup system, based on the details of the data backup system; and conditionally adjusting one or more elements of the data backup system, based on the determining.

Adjusting data backups based on system details

A computer-implemented method according to one embodiment includes causing a failure event in each of a plurality of microservices of a system and collecting failure effect data associated with the caused failure events. A mapping is created detailing transition of the microservices between different states and the collected failure effect data is analyzed for creating the mapping. The method further includes outputting a predetermined notification in response to a determination that a first of the microservices is close to experiencing a predicted failure event, and outputting a suggested solution for repairing the system in response to a determination that the system has failed, using the mapping to identify a root cause of the system failure. Using the mapping to identify the root cause of the system failure includes identifying the microservices that caused the system failure.

Identification and/or prediction of failures in a microservice architecture for enabling automatically-repairing solutions

Embodiments for optimizing database backups to achieve a Recovery Time Object (RTO). A user-defined RTO configured for one or more databases is received. A backup frequency for initiating backups of the one or more databases is determined based on a continuously predicted recovery time associated with a plurality of factors. The backups of the one or more databases are executed at the determined backup frequency to ensure the user-defined RTO is achieved for the backups of the one or more databases. In some embodiments, a recovery window of the one or more databases may be increased using an RTO-aware tiered or remote storage caching operation for portions of the database, and an RTO-aware re-sharding operation on sharded databases may be performed when the backup frequency exceeds a predetermined threshold such that each shard may be restored within the user-defined RTO.

Selective placement and adaptive backups for point-in-time database recovery

A computer-implemented method according to one embodiment includes identifying an accessing of a file within an operating system, checking an in-memory cache for path information associated with the file, checking an external cache for the path information associated with the file, conditionally retrieving the path information associated with the file by performing a file system lookup and adding the path information associated with the file to the in-memory cache and the external cache, and returning the path information.

Implementing a secondary storage dentry cache

A computer system may include a storage device and nodes cooperating therewith to define a key value database architecture. A first node of the nodes may be configured to generate a plurality of checkpoints. The computer system may also include a second node of the nodes configured to operate a log feed cache manager based upon the checkpoints generated by the first node.

Key-value index recovery by log feed caching

A computer-implemented method according to one embodiment includes identifying an accessing of a file within an operating system, checking an in-memory cache for path information associated with the file, checking an external cache for the path information associated with the file, conditionally retrieving the path information associated with the file by performing a file system lookup and adding the path information associated with the file to the in-memory cache and the external cache, returning the path information, and reorganizing the external cache to put file information that is frequently accessed together in a single block or adjacent blocks.

In one embodiment, a method includes determining a data record partition size based on resources used for transferring data from a higher storage tier to one or more lower storage tiers. The method also includes determining which data records stored to the higher storage tier are suitable for export to the one or more lower storage tiers, determining a distribution mapping of the first memory, the distribution mapping indicating a relative distribution of storage locations for all of the data records that are stored to the higher storage tier, identifying all sets of contiguously stored data records on the higher storage tier that are suitable for export and greater in size than the data record partition size, logically sorting, in a descending order of size, the sets of contiguously stored data records, and sending a list of logically sorted sets of contiguously stored data records to an exporter.

Growing community of inventors

San Jose, CA, United States of America

Umesh Deshpande