Abstract: A data structure maintained in a computational device stores how many control areas splits have occurred to store a data set, wherein each control area split causes an addition of a single new control area. A command is received to add a new data record to the data set. A determination is made as to whether adding the new data record to the data set will result in a threshold for control area splits to be exceeded. In response to determining that adding the new data record to the data set will result in the threshold for control area splits to be exceeded, creating at least two new control areas in addition to continuing to use one existing control area for storing the data set.

Abstract: A central hub is coupled to a plurality of computational devices. The central hub stores a data structure that grants locks for accessing common data stored at the central hub, wherein the common data is shared by the plurality of computational devices. Each computational device maintains locally those locks that are held by the computational device in the data structure stored at the central hub. In response to a failure of the data structure stored at the central hub, a selected computational device of the plurality of computational devices is determined to be a manager system. Other computational devices besides the manager system communicate to the manager system all locks held by the other computational devices in the data structure stored at the central hub. The data structure and the common data are generated and stored at the manager system. Transactions are performed with respect to the data structure stored at the manager system, until the data structure stored at the central hub is operational.

Abstract: A method for forward recovery of a catalog of a data storage system, comprising providing a recovery catalog and SMF records. In reverse chronological order, the (i)th entry of the record is checked for a data set change command. If none, the next entry is examined. Otherwise, the (j)th data set is identified and checked for inclusion in the recovery catalog. If it already is, the next entry is selected. If not, a data set location record is added. This process is repeated for each entry in the SMF record. Next, a (h)th data set on the (k)th volume is selected and checked for inclusion in the recovery catalog. If that (h)th data set has been added to the recovery catalog, a next data set is selected. Otherwise, a data set location record for the (h)th data set is added. The process is repeated for each data set on each volume.

Abstract: A central hub is coupled to a plurality of computational devices. The central hub stores a data structure that grants locks for accessing common data stored at the central hub, wherein the common data is shared by the plurality of computational devices. Each computational device maintains locally those locks that are held by the computational device in the data structure stored at the central hub. In response to a failure of the data structure stored at the central hub, a selected computational device of the plurality of computational devices is determined to be a manager system. Other computational devices besides the manager system communicate to the manager system all locks held by the other computational devices in the data structure stored at the central hub. The data structure and the common data are generated and stored at the manager system. Transactions are performed with respect to the data structure stored at the manager system, until the data structure stored at the central hub is operational.

Abstract: A method for data recovery of a data set migrated from a first storage media to a second storage media, where the data set includes a header record and multiple control records interleaved with corresponding data blocks. The header record is examined to identify a number of control records and data blocks comprising the data set. Next, the control records and data blocks are examined in order, starting with an initial data block, until a first data block is identified due to its failure to match the attribute included in the associated control record. Then the control records and data blocks are examined in reverse order, starting with a last data block, until a second data block is identified due to its failure to match an attribute included in the associated control record. Lastly, each data block from the first data block to the second data block are set to a lost data value.

Abstract: An apparatus, system, and method are disclosed for enqueue prioritization. The apparatus for enqueue prioritization is provided with a plurality of modules configured to functionally execute the steps of holding one or more queued requests in a queue, sorting the queued requests according to a first priority identifier associated with each of the queued requests, and assigning a second priority identifier to a delayed request in response to a determination that the delayed request has resided in the queue for a predetermined length of time, wherein the second priority identifier indicates a higher priority than the first priority identifier indicates. These modules in the described embodiments include a queue module, a sorting module, and a reassignment module.

Abstract: A method, system, and computer program product for performing a backup operation in a computing environment is provided. A list of keys identifying a plurality of locked records is created at a start of the backup operation. If a first locked record of the plurality of locked records is obtained during the backup operation, a first key identifying the first locked record is added to the list of keys. At a completion of the backup operation, if a second locked record of the plurality of locked records was not moved during the backup operation, a second key identifying the second locked record from the list of keys is dropped. The list of keys is written to a log file as in-flight updates. The in-flight updates are reprocessed through the backup operation using the log file.

Abstract: A method for data recovery of a data set migrated from a first storage media to a second storage media, where the data set includes a header record and multiple control records interleaved with corresponding data blocks. The header record is examined to identify a number of control records and data blocks comprising the data set. Next, the control records and data blocks are examined in order, starting with an initial data block, until a first data block is identified due to its failure to match the attribute included in the associated control record. Then the control records and data blocks are examined in reverse order, starting with a last data block, until a second data block is identified due to its failure to match an attribute included in the associated control record. Lastly, each data block from the first data block to the second data block are set to a lost data value.

Abstract: An apparatus, system, and method are disclosed for analyzing code paths. In one embodiment, a starting point for one or more code paths within a listing of code is specified. The starting point may include code from which one or more code paths flow. An ending point is also specified for one or more code paths within the code, wherein the ending point includes code that is reachable via one or more of the code paths flowing from the starting point. Each code path flowing from the starting point to the ending point is determined by analyzing the listing of code without execution of the code. Information about the determined code paths is provided to a user.

Abstract: Provided are a method, system, and program for allocating data sets to a container data set. A container data set is allocated in a storage system. An entry is included in a file allocation catalog for the allocated container data set indicating an address range of data allocated to the container data set, wherein the file allocation catalog maps data sets to address ranges in the storage system. A virtual file allocation catalog for the container data set is generated. A request is received to allocate a data set. A determination is made as to whether the data set to allocate has a size less than a threshold size. An entry is included in the virtual file allocation catalog to allocate the data set in the address range of the container data set in response to determining that the data set to allocate size is less than the threshold size.

Abstract: An apparatus, system, and method are disclosed for modifying data set names. A communication module receives a data set name as an index of a catalog entry for a catalog. The data set name comprises at least two qualifiers. A modification module modifies at least one data set name qualifier using a naming algorithm, wherein an alias qualifier is not modified. A store module stores the catalog entry indexed with the modified data set name in order to optimize the location of that entry within the catalog.

Abstract: A plurality of catalogs are maintained, and wherein each catalog of the plurality of catalogs includes data sets and attributes of the data sets. An indication that a new data set is to be defined is received. A selected catalog is determined from the plurality of catalogs, wherein the selected catalog is suitable for including the new data set and attributes of the new data set. An entry that indicates a data set name corresponding to the new data set and an index to the selected catalog is inserted in a group table.

Abstract: An apparatus, system, and method are disclosed for Virtual Storage Access (VSAM) Volume Data Set (VVDS) recovery. A store module stores a data set name and data set characteristics for a data set in a recovery table when the data set is defined under a Z/OS® operating system. The recovery table indexed by the data set name. A retrieve module retrieves a Z/OS® Volume Table of Contents (VTOC) entry indexed by the data set name. In addition, the retrieve module retrieves the data set characteristics from the recovery table using the data set name. A recover module combines the data set characteristics and the VTOC entry to recover a Z/OS® VVDS entry.

Abstract: A method for forward recovery of a catalog of a data storage system, comprising providing a recovery catalog and SMF records. In reverse chronological order, the (i)th entry of the record is checked for a data set change command. If none, the next entry is examined. Otherwise, the (j)th data set is identified and checked for inclusion in the recovery catalog. If it already is, the next entry is selected. If not, a data set location record is added. This process is repeated for each entry in the SMF record. Next, a (h)th data set on the (k)th volume is selected and checked for inclusion in the recovery catalog. If that (h)th data set has been added to the recovery catalog, a next data set is selected. Otherwise, a data set location record for the (h)th data set is added. The process is repeated for each data set on each volume.

Abstract: A central hub is coupled to a plurality of computational devices. The central hub stores a data structure that grants locks for accessing common data stored at the central hub, wherein the common data is shared by the plurality of computational devices. Each computational device maintains locally those locks that are held by the computational device in the data structure stored at the central hub. In response to a failure of the data structure stored at the central hub, a selected computational device of the plurality of computational devices is determined to be a manager system. Other computational devices besides the manager system communicate to the manager system all locks held by the other computational devices in the data structure stored at the central hub. The data structure and the common data are generated and stored at the manager system. Transactions are performed with respect to the data structure stored at the manager system, until the data structure stored at the central hub is operational.

Abstract: A method, system, and computer program product for performing a backup operation in a computing environment is provided. A list of keys identifying a plurality of locked records is created at a start of the backup operation. If a first locked record of the plurality of locked records is obtained during the backup operation, a first key identifying the first locked record is added to the list of keys. At a completion of the backup operation, if a second locked record of the plurality of locked records was not moved during the backup operation, a second key identifying the second locked record from the list of keys is dropped. The list of keys is written to a log file as in-flight updates. The in-flight updates are reprocessed through the backup operation using the log file.

Abstract: An apparatus, system, and method are disclosed for enqueue prioritization. The apparatus for enqueue prioritization is provided with a plurality of modules configured to functionally execute the steps of holding one or more queued requests in a queue, sorting the queued requests according to a first priority identifier associated with each of the queued requests, and assigning a second priority identifier to a delayed request in response to a determination that the delayed request has resided in the queue for a predetermined length of time, wherein the second priority identifier indicates a higher priority than the first priority identifier indicates. These modules in the described embodiments include a queue module, a sorting module, and a reassignment module.

Abstract: An apparatus, system, and method are disclosed for enqueue prioritization. The apparatus for enqueue prioritization is provided with a plurality of modules configured to functionally execute the necessary steps of anticipating a need to access a computing resource, generating a dummy request, the dummy request configured to hold a place for an actual request in a queue of requests to access the computing resource, and generating an actual request to access the computing resource, wherein the actual request is configured to replace the dummy request in the queue. These modules in the described embodiments include a forecast module, a dummy generator, and a request generator.

Abstract: A method is disclosed to detect and repair a broken dataset. The method creates and maintains a backup log and an update log for a dataset. If the method finds a dataset structural error, then the method deletes the corrupted dataset, obtains the most current backup copy of the dataset, obtains all dataset updates made after the most current backup copy of the dataset was saved, and generates a recovered dataset using the most current backup and the dataset updates.