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 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 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 method, apparatus, and computer program product for optimizing the organization of volume records stored in a volume record data set is disclosed herein. In certain embodiments, a method may include monitoring a volume comprising multiple data sets. Each data set may have associated therewith a volume record stored in a volume record data set. The method may further include tracking read and write operations to each of the data sets over a period of time. A count value may be stored in the volume record of each data set. The count value may be increased each time a read operation is performed to the associated data set. The count value may be decreased each time a write operation is performed to the associated data set. The volume records in the volume record data set may then be reorganized according to the size of the count values.

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 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: 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: A method is disclosed to debug a computer program. The method provides a computer program comprising source code, and a listing of that source code. The method further provides a computing device comprising a data storage medium, and stores the computer program in that data storage medium. The method then runs the computer program, and subsequently detects an error condition. The method creates and saves to the data storage medium a dump file comprising (N) save areas. Using information abstracted from the dump file and the source code listing, the method reproduces the source code execution at the time the error condition was detected.

Abstract: Described are embodiments of an invention for allocating storage space in a storage system for critical data sets. The computing environment includes at least one server including a processor and memory. The server is coupled to storage. The memory further includes a storage manager including an allocation module and an alert module. The storage manager defines a common area for storing non-critical data sets and critical data sets in the storage group. The storage manager also defines a critical reserve area for storing only critical data sets in the first storage group. A predefined percentage of available storage space is reserved for the critical reserve area. The predefined percentage of available space is determined by comparing the available storage space within the critical reserve area to the storage space in the storage group.

Abstract: An apparatus, system, and method are disclosed for resolving computing resource deadlocks. In one embodiment, the present invention includes detecting a set of deadlocked processes within a set of executing processes, cancelling a lowest priority process of the set of deadlocked processes, generating a requested resources report for the set of executing processes, and enabling a user to assign a priority level to a process. In one embodiment, resolving computing resource deadlocks will efficiently detect deadlocks by using a report already generated by the operating system detailing information about allocated resources. By analyzing the resources report to gain information regarding executing processes, deadlocks may be easily determined and remedied. Resolving computing resource deadlocks may be conducted by a utility or it may run as a service of the operating system.

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 directory and members are allocated to store a data set, wherein the directory stores pointers to the members to allow data stored in the members to be accessed. The directory is expanded to accommodate an expansion of the data set, causing the directory to be stored in non-contiguous pages and becoming fragmented. A computational device determines that a threshold that measures a level of fragmentation of the directory relative to an amount of storage allocated for the data set has been exceeded. The computational device reorganizes the fragmented directory, into a reorganized directory that is stored in contiguous pages at the end of the data set, in response to determining that the threshold has been exceeded.

Abstract: A method, system, and computer program product for implementing Serviceability Level Indicator Processing (SLIPs) for storage alterations in a computer system is provided. A plurality of storage release requests is analyzed to identify an address monitored by a storage alteration slip. Upon identification of the address, the storage alteration slip is disabled and an initialization slip is re-enabled.

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: Provided are a method, system, and article of manufacture to manage storage resources in a storage system. Requests by processing systems are received for access to a control block providing information on an address assigned to one of the storage resources to access. A token is generated for each processing system requesting the control block uniquely identifying the processing system and the control block. The processing systems are provided copies of the requested control blocks to use to access the storage resource. A request is received to modify one of the control blocks for one of the storage resources. A determination is made as to whether at least one of the tokens was generated for the control block to modify. At least one processing system associated with the determined at least one token is provided a copy of the modified control block to use to access the storage resource associated with the control block.

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: Various embodiments for rapid defragmentation of storage volumes in a computing environment are provided. A plurality of source data sets is copied from the fragmented storage volume to a plurality of target data sets on an additional storage volume. The plurality of source data sets is placed on the additional storage volume as the plurality of target data sets in an unfragmented order. A first volume serial number (VOLSER) of the fragmented storage volume is swapped with a second VOLSER of the additional storage volume. The fragmented storage volume is varied offline, and the additional storage volume is varied online. The computing environment recognizes the additional storage volume having the plurality of target data sets placed in the unfragmented order.

Abstract: Provided are a computer program product, system and method for updating class assignments for data sets during a recall operation in a storage environment having a plurality of storage devices. Information on a data set is processed to determine at least one current attribute of the data set. A determination is made as to whether the determined at least one current attribute satisfies a criteria. Indication is made in a catalog to change a class associated with the data set in response to determining that the at least one current attribute satisfies the criteria, wherein the class is used to determine how to manage the data set. The data set is migrated from a first storage to a second storage. A recall operation is initiated to recall the data set from the second storage.

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.