International Business Machines Corporation

Globalfoundries Inc.

David C Reed

Max D Smith

Franklin Emmert McCune

Gregory E McBride

Miguel Angel Perez

Esteban Rios

Thomas C Reed

Douglas Lee Lehr

Philip R Chauvet

Dash D Miller

Kyle Barret Dudgeon

Michael Robert Scott

Richard Albert Welp

Joseph V Malinowski

Nikhil Khandelwal

Derek Logan Erdmann

Dustin A Helak

Harold Steven Huber

Thomas W Bish

Joel Leslie Masser

David Bruce LeGendre

Neal E Bohling

Carrie B Wood

Herman Aranguren

Theresa Mary Brown

Carol Santich Mellgren

Eric J Harris

Preston A Carpenter

Bard Allen Doster

Kenneth J Owin

David Michael Shackelford

Warren Keith Stanley

John Glenn Thompson

Nicolas Marc Clayton

Ronald David Boenig, Ii

Ryan J Wisniewski

Gregg Leonard Liguori

Jeffrey Thomas Sheridan

Jon Christopher Belisle

Keith R Smith

Joseph M Swingler

Shaun E Harrington

Erika Dawson

Tabor R Powelson

Aaron S Palazzolo

Thaiese Nicole Trader

Charles J House

Andrew E Deiss

Emmanuel Barajas Gonzalez

Khang N Nguyen

Kenneth J Gibes

Donna Weaver

Trevor A Geisler

Ryan Arthur Bouchard

Marina V Lopez

Sharon M Niederbrach

Thomas J Gair, Jr

Sosuke Matsui

Chen Zhao

Anil Kalavakolanu

Brian W Hart

Christina Ann Lara

Marc A Martin

Arthur J Bariska, Jr

Cecilia Carranza Lewis

Stephen Alfred Haley

Robin L Elaiho

Franklin E Mccune

Becky Enderle

Samantha Jean Wareing

Peter Hung Quach

Issak Sanchez

Jamie Storey

Nicholas Ikaika Bostwick

Matthew Barragan

George Kozakos

Dianne Gamarra

Susan Van Berkel

Elliot Picker

Darrell Christopher Clarke

Parker Mathewson

Yi Chiao Cheng

Aruun K Kumar

Apoorva Sachdev

Herbert Yee

Robin Lea Ursery

Rubi Roxana Ballesteros

Neil Everett Bohling

Quyen H Pham

Samuel Ryan Smith

A computer-implemented method (CIM), according to one embodiment, includes performing a reorganization analysis for mitigating latency during reorganization of a data set. The reorganization analysis includes using regression analysis to predict a time duration that reorganization of the data set will take based on a total size of the data set, relating the predicted time duration to a previous data set reorganization time duration, and performing linear extrapolation to estimate a time at which the total size of the data set will exceed a predetermined percentage of a maximum size of the data set. The method further includes reorganizing the data set before the estimated time, where the data set is reorganized at a time determined based on the reorganization analysis or derivative thereof.

Reorganization of a data set

Provided are a computer program product, system, and method to determine whether a holding of a lock to the resource by a first task satisfies a condition and whether the lock is swappable. The lock is released from the first task and granted to a second task waiting in a queue for the lock in response to determining that the holding of the lock satisfies the condition and that the lock is swappable. The first task is indicated in the queue waiting for the lock in response to granting the lock to the second task.

Determining when to release a lock from a first task holding the lock to grant to a second task waiting for the lock

Provided are a computer program product, system, and method for a data set connection manager having a plurality of data sets to represent one data set. A request is processed to open a connection to a data set having members, wherein the connection is used to perform read and write requests to the members in the data set. In response to establishing the connection, establishing for the connection a primary data set having all the members; a secondary data set to which updated members in the primary data set are written; and a pending delete data set to pending delete members comprising members that are updated.

Data set connection manager having a plurality of data sets to represent one data set

Provided are a computer program product, system, and method for recovering from a pending uncompleted reorganization of a data set managing data sets in a storage. In response an initiation of an operation to access a data set, an operation is initiated to complete a pending uncompleted reorganization of the data set in response to the data set being in a pending uncompleted reorganization state and no other process currently accessing the data set.

Recovering from a pending uncompleted reorganization of a data set

A method for more effectively utilizing computing resources in a data replication environment is disclosed. In one embodiment, such a method detects, at a primary system, activity occurring on the primary system. This activity is recorded in systems logs located at the primary system. The method automatically mirrors the system logs from the primary system to a secondary system that is in a mirroring relationship with the primary system. The system logs are analyzed at the secondary system. In the event abnormal activity is detected in the system logs at the secondary system, the method automatically sends, from the secondary system to the primary system, one or more commands that are designed to address the abnormal activity. A corresponding system and computer program product are also disclosed.

Remote health monitoring in data replication environments

A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.

Dynamic switching of catalog sharing protocols

A computer-implemented method according to one embodiment includes, prior to executing a point-in-time copy job, running a space checker program to generate a list that includes: source data sets that will be used in the point-in-time copy job and a pool of potential target volumes that are eligible to be used for the point-in-time copy job. The method further includes determining that insufficient space is available on the potential target volumes to perform the point-in-time copy job. An on-demand migration is issued against one or more target volumes of the pool of potential target volumes for ensuring there is sufficient space available on the one or more target volumes associated with the issued on-demand migration to perform the point-in-time copy job. The method further includes performing the point-in-time copy job.

Ensuring sufficient space is available on target volumes before performing a point-in-time copy job

A computer-implemented method according to one embodiment includes identifying a first data set to be backed up, where the first data set is stored on a first storage volume; removing empty data tracks from the first data set to create an intermediary data set; storing the intermediary data set at a plurality of secondary storage volumes different from the first storage volume; and creating a backup data set for the first data set, utilizing the intermediary data set.

Creating a backup data set

A method for preventing data overlays in a data storage system is disclosed. In one embodiment, such a method detects a write operation directed to a storage area of a data storage system. The write operation includes one or more of a format write operation and a full-track write operation. Upon detecting the write operation, the method determines a data set that is associated with the storage area. The method analyzes metadata associated with the data set to determine whether the storage area contains valid data. In the event the storage area contains valid data, the method performs a data protection operation that prevents execution of the write operation and/or logs details of the write operation. A corresponding system and computer program product are also disclosed.

Data set overlay protection

A method for enabling data set changes to be reverted to a prior point in time or state is disclosed. In one embodiment, such a method includes providing a data set comprising one or more data elements and a specified number of generations of the data elements. In certain embodiments, the data set is a partitioned data set extended (PDSE) data set, and the data elements are 'members' within the PDSE data set. The method further includes tracking changes made by a job to data elements of the data set. The method further references, in a data structure (also referred to herein as a 'cluster') associated with the job, previous generations of the data elements changed by the job. In certain embodiments, the data structure is stored in the data set. A corresponding system and computer program product are also disclosed.

PDSE member generation clustering and recovery

Provided are a computer program product, system, and method for using a machine learning module to rank technical solutions to user described technical problems to provide to a user. A solutions database is searched to determine a result set of answer files having keywords related to keywords of a technical problem in a user description. The result set of answer files, the user description of the technical problem, user profile information, and technical specifications of the computing system are provided as input to a machine learning module. The machine learning module outputs ranks of the answer files in the result set. A subset of answer files in the result set is selected based on ranks of the answer files in the result set and returned to the user.

Using a machine learning module to rank technical solutions to user described technical problems to provide to a user

Provided are a computer program product, system, and method for selecting a plurality of processing systems to sort a data set. A determination is made of processing systems to perform a sort of records in a data set. The data set is divided into data subsets, each data subset comprising a portion of the records of the data set. Each of the determined processing systems of is notified of a data subset to sort. In response to receiving notification from the determined processing systems that the records in the data subsets have been sorted, the sorted data subsets are merged into a sorted data set comprising the records of the data set sorted.

Selecting a plurality of processing systems to sort a data set

A method can include obtaining catalog data of a catalog. The catalog can include one or more records. The method can further include detecting one or more damaged records among the one or more records and isolating the one or more damaged records. The method can further include identifying one or more undamaged records among the one or more records. The method can further include transferring the one or more undamaged records to a backup catalog. The method can further include obtaining a transfer status of a first undamaged record of the one or more undamaged records. The method can further include obtaining an access request corresponding to the first undamaged record. The method can further include determining, based on the transfer status, a response to the access request and generating, based at least in part on the backup catalog, a restored catalog.

Catalog restoration

A method for modifying a configuration of a storage system. The method includes a computer processor querying a network-accessible computing system to obtain information associated with an executing application that utilizes a storage system for a process of data mirroring. The method further includes identifying a set of parameters associated with a copy program executing within a logical partition (LPAR) of the storage system based on the obtained information, where the set of parameters dictates a number of reader tasks utilized by the copy program, where the copy program is a program associated with the process for data mirroring from the network-accessible computing system to the storage system. The method further includes executing the dictated number of reader tasks for the process of mirroring data associated with the executing application, from the network-accessible computing system to the storage system.

Modifying aspects of a storage system associated with data mirroring

Described are techniques for utilization of a disaster recovery site including a method comprising receiving a mirrored data stream at a disaster recovery site from a production site. The mirrored data stream includes a workload instruction stored in a designated location of the mirrored data stream. The workload instruction indicates an operation to perform on a set of data that is replicated between the production site and the disaster recovery site and a time indicator indicating a correct version of the set of data. The method further comprises generating a consistency point by retrieving replicated data from the disaster recovery site corresponding to the correct version of the set of data in the production site. The method further comprises performing the operation on the consistency point, generating an output, and transmitting the output to the production site.

Workload coordination on disaster recovery site

Growing community of inventors

Tucson, AZ, United States of America

David C Reed