Abstract: 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.

Abstract: Provided are a computer program product, system, and method for processing a write of records to maintain atomicity for writing a defined group of records to multiple tracks. A write is received comprising defined groups of records to write to a plurality of tracks in the primary storage system. Sub-writes are generated to write the records in the defined groups in the write. At least one of the sub-writes includes records to write for at least one of the defined groups that spans multiple tracks in response to determining that at least one of the defined groups includes records that will be written to multiple tracks. The sub-writes are transmitted to the primary storage system to mirror to the secondary storage system to cause the secondary storage system to return complete in response to completing writing to all the tracks written to by the sub-write.

Abstract: Provided are a computer program product, system, and method for mirroring writes of records to maintain atomicity for writing a defined group of records to multiple tracks. Sub-writes are received from a host system to write records in defined groups in a write, wherein at least one of the sub-writes includes records to write for at least one of the defined groups that spans multiple tracks. For each of the sub-writes including records for at least one of the defined groups that spans multiple tracks, the tracks in the sub-write with to the secondary storage system to cause the secondary storage system to apply the tracks upon receiving all the tracks for the sub-write. Complete is returned for the sub-write to the host system upon receiving confirmation from the secondary storage system that all the tracks for the sub-write have been applied to the secondary storage system.

Abstract: 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.

Abstract: An apparatus, method, system, and program product are disclosed for mirroring resynchronization. In one example, an apparatus includes a mirroring status determination module that detects suspension of mirroring. The apparatus, in a further embodiment, includes a suspension determination module that determines a first change in at least one parameter that resulted in the detected suspension of mirroring. In various embodiment, the apparatus includes a parameter detection module that detects a second change in the at least one parameter that enables resuming minoring. In some embodiments, the parameter detection module detects the first change in the at least one parameter. In one embodiment, the apparatus includes a synchronization module that resumes minoring in response to the parameter detection module detecting the second change.

Abstract: Apparatuses, methods, and computer program products are provided for anonymizing a data set having an index component and a data component. In certain embodiments, the apparatuses, methods and computer program products make a copy of the data set, removes personal information from the data component, modifies an index component key value with a random value, modifies a data component key value with the same random value, and maintains a data set structure of the index component and the data component.

Abstract: 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.

Abstract: A method for backing up data is disclosed. In one embodiment, such a method includes identifying a volume of data to back up, and determining a number of backup tasks that can operate in parallel to back up data in the volume. The number of backup tasks may be based on an amount of memory available, a fragmentation level of a target storage area, a number of tape mounts that are available, or the like. The method then divides the volume into a number of sections corresponding to the number of backup tasks. Each section is associated with a particular backup task. The method then initiates the backup tasks to back up their corresponding sections in parallel. In certain embodiments, each backup task generates a data set storing backup data from its corresponding section. A corresponding system and computer program product are also disclosed.

Abstract: 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.

Abstract: A method for preemptively migrating data in a tiered storage system is disclosed. In one embodiment, such a method includes identifying a regularly scheduled event that is associated with an increase in I/O activity. The method further identifies a virtual storage resource (e.g., file, data set, logical volume) associated with the increase in I/O activity. A timeline is then analyzed to determine timing for the regularly scheduled event. The method automatically promotes the virtual storage resource from lower-performing storage media to higher-performing storage media immediately prior to a start of the regularly scheduled event. The method automatically demotes the virtual storage resource to the lower-performing storage media after completion of the regularly scheduled event. A corresponding system and computer program product are also disclosed.

Abstract: 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.

Abstract: A method, system and computer readable medium that predict times where cost of catalog caching is not efficient and deactivating catalog caching for that catalog during the predicted times. More specifically, an optimized catalog caching operation conducts historical analysis on catalog usage via records such as resource measurement facility (RMF) records and catalog statistical data.

Abstract: 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.

Abstract: A method according to one embodiment includes determining to temporarily extend an initial volume to be defragmented, identifying a plurality of additional volumes pooled with the initial volume within a storage group, identifying an area on each of the plurality of additional volumes pooled with the initial volume within the storage group to use for temporarily extending the initial volume, allocating the identified area on each of the plurality of additional volumes as a temporary extension of the initial volume, including, for each of the plurality of additional volumes, creating an entry in a VTOC of the additional volume that indicates that a non-VSAM data set resides at a location of the identified area on the additional volume, setting a plurality of pointers within a VTOC of the initial volume, where the plurality of pointers includes a pointer to the identified area on additional volumes, and defragmenting the initial volume.

Abstract: 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.

Abstract: A method for dynamically modifying data set generation depth is disclosed herein. In one embodiment, such a method includes providing a data set comprising one or more data elements. For each data element, a maximum generations number is designated that specifies a maximum number of generations of the data element to retain in the data set. The method monitors an access rate (e.g., creation rate, update rate, etc.) for each data element and dynamically alters, for each data element, the maximum generations number in accordance with the data element's access rate. In certain embodiments, the maximum generations number of a data element is increased as its access rate increases. Similarly, the maximum generations number of a data element may be decreased as its access rate decreases. A corresponding system and computer program product are also disclosed.

Abstract: 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.

Abstract: 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.

Abstract: A method for partially reorganizing a volume is disclosed. In one embodiment, such a method includes logically dividing a volume into multiple regions. The method further enables a computing system to perform a data reorganization operation on a particular region of the multiple regions, while enabling I/O to continue to the other regions. In the event a request for a data set allocation is received for the particular region while the data reorganization operation is taking place, the method automatically performs the data set allocation within other regions of the volume. When the data reorganization operation is complete, the method automatically moves the data set allocation from the region in which it was performed to the region associated with the original request.

Abstract: A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to: receive, by the computer, a data set allocation request; determine, by the computer, whether a size of the data set is greater than a threshold; use, by the computer, first key values in a first index to select a volume in response to determining that the size of the data set is greater than the threshold; use, by the computer, second key values in a second index to select a volume in response to determining that the size of the data set is less than the threshold; perform, by the computer, the allocation request in the selected volume; and store, by the computer, control data about the data set in the control data set corresponding to the selected volume.