Abstract: A method, system, and computer program product for performing a backup operation in a computing environment is provided. A dataset corresponding to a backup copy is examined to determine if the dataset has changed from a previous backup operation. If the dataset has not changed, a backup inventory registry is consulted to determine a current version of a backup copy. The current version is one of a plurality of available versions. The backup operation is performed using the current version of the backup copy.

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 system and method that provide for decision support and/or training support in crisis decision-making situations are provided. In one implementation, for example, a method identifies patterns from known cases based on information from a crisis event. Each of the known cases includes attributes and at least one outcome. The method also identifies a first subset of the known cases that relate to the identified patterns from the known cases. The method also analyzes the identified patterns to determine a cue that, if answered, will provide a second subset of the known cases including a more converged range of decision outcomes than the first subset.

Abstract: A method for reorganizing a catalog to improve I/O performance includes initially placing a shared lock on a source catalog. The method then makes a point-in-time copy of the source catalog to generate a target catalog. Once the target catalog is generated, the method reorganizes the contents of the target catalog. Optionally, while reorganizing the contents of the target catalog, the method temporarily releases the shared lock on the source catalog and mirrors I/O intended for the source catalog to a buffer. The buffered I/O may then be used to update the target catalog to bring it current with the source catalog. When the target catalog is reorganized and up-to-date, the method upgrades the shared lock on the source catalog to an exclusive lock, overwrites the source catalog with the target catalog, and releases the exclusive lock. A corresponding apparatus and computer program product are also disclosed and claimed herein.

Abstract: An extractor has a duct door moveably mounted to a working air conduit for movement between a first position at which normal suction at a suction nozzle is reduced and a second position at which normal suction at the suction nozzle is unreduced. An actuator is connected to the duct door for selectively moving the duct door between the first position and second position. In one embodiment, a suction leak hole is formed within the working air conduit and the duct door is moveable with respect to the leek hole to selectively fluidly open and close the leak hole. In another embodiment, the duct door is moveable within the working air conduit to selectively fluidly restrict the working air flow in the working air conduit and the actuator selectively moves the duct door between the first and second positions. The suction reduction selectively increases the cleaning solution dwell time.

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: A method for identifying records of variable length within a data block containing corrupted data is disclosed herein. In certain embodiments, such a method may include scanning backward from an end of a data block containing variable-length records. The backward scan may proceed, one record at a time, to identify a first span of good (i.e., non-corrupt) records. The method may further include scanning forward from a front of the data block, also proceeding one record at a time, to identify a second span of good records. The method may include identifying a problem region by identifying data that resides between the first span and the second span. The method may also include creating a new record between the first span and the second span that contains the problem region. A corresponding computer program product, apparatus, and system are also disclosed.

Abstract: Embodiments related to measuring process pressure in low-pressure semiconductor processing environments are provided. In one example, a semiconductor processing module for processing a substrate with a process gas in a vacuum chamber is provided. The example module includes a reactor positioned within the vacuum chamber for processing the substrate with the process gas and a pressure-sensitive structure operative to transmit a pressure transmission fluid pressure to a location exterior to the vacuum chamber. In this example, the pressure transmission fluid pressure varies in response to the process gas pressure within the vacuum chamber.

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 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 identifying an overlay of a data processing target structure in a computing environment is provided. At least one of examining a mapping macro for the target structure with a set of valid ranges, comparing the set of valid ranges with the target structure to identify a string of at least one first invalid value and a last invalid value and locate invalid regions of the target structure, and examining executable code associated with the target structure, comparing at least one unchanged module against at least one additional module exhibiting an overlay characteristic to identify the string of the at least one first invalid value and the last invalid value and locate invalid regions of the target structure, is performed.

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