Abstract: A method for monitoring I/O is disclosed. In one embodiment, such a method includes identifying various stages of an I/O process. The method further monitors progress of an I/O operation as it advances through the stages of the I/O process. The method records, in a data structure associated with the I/O operation, timing information indicating time spent in each of the stages. This timing information may include, for example, entry and exit times of the I/O operation relative to each of the stages. In the event the I/O operation exceeds a maximum allowable time spent in one or more of the stages, the method generates an error. Various recovery actions may be taken in response to the error. A corresponding system and computer program product are also disclosed.

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: A method for dynamically tuning I/O performance is disclosed. In one embodiment, such a method includes identifying various stages of an I/O process. The method further monitors progress of an I/O operation as it advances through the stages of the I/O process. The method records, in a data structure associated with the I/O operation, timing information indicating time spent in each of the stages. This timing information may include, for example, entry and exit times of the I/O operation relative to each of the stages. In the event the I/O operation exceeds a maximum allowable time spent in one or more of the stages, the method automatically adjusts an allocation of computing resources to one or more stages of the I/O process. A corresponding system and computer program product are also disclosed.

Abstract: A method for analyzing data corruption is disclosed. In one embodiment, such a method includes identifying a data set containing corrupted data. The method identifies a specific location within the data set containing the corrupted data and analyzes the specific location to determine if the corrupted data is contained therein. The method repeatedly performs the following until the corrupted data is no longer found within the specific location: revert to a previous version of the specific location by removing an incremental update to the specific location, and analyze the previous version of the specific location to determine if it contains the corrupted data. When a previous version of the specific location is found that no longer contains the corrupted data, the method determines a timestamp associated with the previous version and provides the timestamp to a user. A corresponding system and computer program product are also disclosed.

Abstract: A method for analyzing data corruption is disclosed. In one embodiment, such a method includes identifying a data set containing corrupted data. The method searches the data set for the corrupted data to verify that the corrupted data is contained within the data set. The method repeatedly performs the following until the corrupted data is no longer found within the data set: revert to a previous version of the data set by removing an incremental update to the data set, and search the previous version for the corrupted data. When a previous version of the data set is found that no longer contains the corrupted data, the method determines a timestamp associated with the previous version and provides the timestamp to a user. A corresponding system and computer program product are also disclosed.

Abstract: A method for providing different message information to users based on authorization level is disclosed. In one embodiment, such a method includes detecting an event, such as an error or abnormal termination, in a hardware or software product. The method generates a message in association with the event and determines an authorization level of a user intended to receive the message. In the event the user is associated with a first authorization level, the method includes first content in the message. In the event the user is associated with a second authorization level, the method includes second content in the message. The second content may be more comprehensive than the first content. A corresponding system and computer program product are also disclosed.

Abstract: A method for analyzing a potential data breach is disclosed. In one embodiment, such a method includes identifying a time frame and data store in which a data breach potentially occurred. The method reconstructs the data store to a point in time near an end of the time frame. The method then repeatedly performs the following until the data store reaches a point in time near a beginning of the time frame: revert to a previous version of the data store by removing an incremental update to the data store; record changes to the data store caused by removing the incremental update; and record timestamps associated with the changes. Once the data store reaches the point in time near the beginning of the time frame, the method creates a report that documents the changes and the timestamps and provides the report to a user. A corresponding system and computer program product are also disclosed.

Abstract: A method for validating data in a copy repository is disclosed. In one embodiment, such a method includes establishing a template that designates valid fields within a data set, as well as valid values and types of data within the fields. The method further establishes a timeframe over which to validate versions of the data set residing in a copy repository. Starting at a first end of the timeframe and proceeding to a second end, the method validates each version of the data set residing in the copy repository. To accomplish this, the method configures a computing system to a state that existed when the version was created in the copy repository. The method then opens the version on the computing system and validates the version against the template. A corresponding system and computer program product are also disclosed.

Abstract: A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.

Abstract: A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.

Abstract: A computer program product, system, and method for switching over from using a first primary storage to using a second primary storage when the first primary storage is in a mirror relationship. Migration operations are initiated to migrate data in the first primary storage to a second primary storage while the data in the first primary storage indicated in first change recording information is mirrored to a secondary storage and switch from using the first primary storage to the second primary storage. Resynchronization operations are initiated to indicate changes to data in the second primary storage in a second change recording information, copy writes from the second primary storage indicated in the first and the second change recording information to the secondary storage, and mirror writes to the second primary storage to the secondary storage in response to the copying the writes.

Abstract: A method for validating data is disclosed. In one embodiment, such a method includes reading a data element from a volume. The method determines a location of the data element within the volume. This location is mapped to a particular data set stored on the volume, such as by mapping the location to the particular data set using a volume table of contents (VTOC) associated with the volume. The method further determines a first identifier (e.g., a creation date) associated with the particular data set and compares this first identifier to a second identifier (e.g., a creation date) appended to the data. If the first identifier matches the second identifier, the method validates the data. A corresponding system and computer program product are also disclosed.

Abstract: A method for limiting I/O access in shared storage systems is disclosed. In one embodiment, such a method includes establishing, for a volume, a list of address spaces that are authorized to access the volume. The method further receives an I/O request to access the volume and determines whether the I/O request originates from one of the address spaces identified in the list. If the I/O request originates from one of the address spaces in the list, the method passes the I/O request to the volume. If, on the other hand, the I/O request does not originate from one of the address spaces in the list, the method blocks the I/O request. A corresponding system and computer program product are also disclosed.

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 copying data from multiple point-in-time copies to a log storage to use to roll-back a source storage managing point-in-time copies of a source storage. A plurality of point-in-time copies of a source storage at different point-in-times are established. In response to receiving writes to the source storage after establishing each of the point-in-time copies, point-in-time data in the source storage is copied, before being updated by the received writes, to a log storage, wherein the log storage stores point-in-time data for multiple of the point-in-time copies. The log storage is used to roll-back the source storage to a selected point-in-time of one of the point-in-time copies.

Abstract: A method for validating data is disclosed. In one embodiment, such a method includes reading a data element from a volume. The method determines a location of the data element within the volume. This location is mapped to a particular data set stored on the volume, such as by mapping the location to the particular data set using a volume table of contents (VTOC) associated with the volume. The method further determines a first identifier (e.g., a creation date) associated with the particular data set and compares this first identifier to a second identifier (e.g., a creation date) appended to the data. If the first identifier matches the second identifier, the method validates the data. 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: Provided are a computer program product, system, and method for using mirror indicators to indicate whether to mirror tracks in a data set in a primary volume mirrored to a secondary volume. A table includes a mirror indicator for each of a plurality of tracks in at least one data set in the primary volume indicating whether a track is to be mirrored to the secondary volume. In response to a write command of write data for one of the tracks in the primary volume, creating a record set in a cache for the primary volume including write data for the track to transfer to the secondary volume in response to the mirror indicator for the track indicating that the track is to be mirrored. The write data in the record set is transferred from the cache to the secondary volume.

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.