International Business Machines Corporation

Globalfoundries Inc.

Max D Smith

David C Reed

Franklin Emmert McCune

Douglas Lee Lehr

Esteban Rios

Thomas C Reed

Kyle Barret Dudgeon

Miguel Angel Perez

Philip R Chauvet

Joseph V Malinowski

Michael Robert Scott

Derek Logan Erdmann

Dustin A Helak

Harold Steven Huber

Joel Leslie Masser

David Bruce LeGendre

Dash D Miller

Neal E Bohling

Carrie B Wood

Bard Allen Doster

Herman Aranguren

Eric J Harris

Preston A Carpenter

Ryan J Wisniewski

Jeffrey Thomas Sheridan

Jon Christopher Belisle

Joseph M Swingler

Shaun E Harrington

Erika Dawson

Nadim P Shehab

Corey G Smeaton

Keith R Smith

Thaiese Nicole Trader

Charles J House

Harry M Yudenfriend

Beth Ann Peterson

Gail Andrea Spear

Emmanuel Barajas Gonzalez

John Richard Paveza

Ronald E Bretschneider

Khang N Nguyen

Andrew E Deiss

Thomas J Gair, Jr

Kenneth J Gibes

Trevor A Geisler

Marina V Lopez

Sharon M Niederbrach

Gregory E McBride

Anil Kalavakolanu

Brian W Hart

Arthur J Bariska, Jr

Marc A Martin

Gregg Leonard Liguori

Stephen Alfred Haley

Robin L Elaiho

Aruun K Kumar

Herbert Yee

Robin Lea Ursery

Neil Everett Bohling

Quyen H Pham

Yi Chiao Cheng

Apoorva Sachdev

Darrell Christopher Clarke

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 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 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 generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.

Generating node access information for a transaction accessing nodes of a data set index

In one aspect of the present description, operations are described for detecting whether programming code of a first computer program has been modified by a second computer program. In one embodiment, the modification detecting includes registering a first section of programming code of the first computer program in a first registry data structure. To detect a modification, the registered first section of programming code may be validated. In one embodiment, the validating includes comparing the section of programming code actually located at the first memory address to the registered first section of programming code. In another aspect, various selectable remedial actions may be taken upon detecting modification of programming code of the first computer program. Other features and aspects may be realized, depending upon the particular application.

Programming code execution management

A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets includes a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The method further indicates, in the metadata of the first data set, a maximum number of generations allowable in each of the first and second data sets When a primary member is modified in the first data set, the method automatically moves an oldest generation in the first data set to the second data set, and deletes an oldest generation in the second data set to ensure that the extended generation group does not exceed the maximum number.

PDSE extended generation grouping for tiered storage systems

Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.

Managing multiple locks for data set members in a data set index

Provided are a computer program product, system, and method to remove selected user identifiers to include in an event message based on a context of an event. A determination is made of multiple user identifiers in a group of selected user identifiers for one event name for an event message for an event to schedule. A determination is made of a context of the event to schedule. At least one of the multiple user identifiers that are not included in at least one message with an event initiator that initiated the event to schedule, having a message context matching the determined context of the event to schedule, are removed from the group of selected user identifiers to produce a modified group of selected user identifiers. An event message is generated to transmit to addresses for the modified group of selected user identifiers with information on the event to schedule.

Remove selected user identifiers to include in an event message based on a context of an event

An asynchronous remote copy relationship is maintained between primary storage volumes of a primary storage controller and secondary storage volumes of a secondary storage controller. A command is initiated to generate a point in time copy of a source volume of the primary storage controller to a target volume of the primary storage controller. A mirroring is performed of results of the point in time copy to the secondary storage controller to generate a source volume and a target volume in the secondary storage controller. Data from the target volume in the secondary storage controller is archived to a cloud storage.

Archival to cloud storage while performing remote backup of data

Provided are techniques for asynchronous remote mirror cloud archival. A data mover of a remote host receives, from an asynchronous remote mirror copy system of a primary storage controller, an archive copy operation, wherein the archive copy operation identifies a list of tracks of data and a location of cloud storage in a cloud infrastructure for storing the data from the tracks. The data mover issues, to a secondary storage controller, the archive copy operation, wherein the secondary storage controller archives the data from secondary storage to the cloud storage by invoking a cloud service, wherein the secondary storage stores data of primary storage of the primary storage controller.

Asynchronous remote mirror cloud archival

Methods that can parallel search a partitioned data set extended (PSDE) indexes are provided. One method includes managing a set of quick indexes in a memory device in which the set of quick indexes include references to storage locations for a subset of members of a PDSE stored in a set of long-term storage devices. The method further includes receiving a request to determine a storage location of a member of the PDSE and, in response to the request, searching the set of quick indexes to determine the storage location. Systems and computer program products for performing the above method are also provided.

Parallel search of a partitioned data set extended (PDSE) in parallel

A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted.

Managing a data set

Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. At least at least one duration parameter indicates an amount of time after which an unused page implement one of the internal nodes or leaf nodes is eligible for reuse. Selection is made of at least one selected page allocated to at least one of the leaf nodes and the internal nodes that has not been used for one of the at least one duration parameter for reuse.

Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse

Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server.

Migrating jobs from a source server from which data is migrated to a target server to which the data is migrated

Growing community of inventors

Tucson, AZ, United States of America

Max D Smith