Abstract: Various embodiments for failure recovery in a computing environment following a data restoration are provided. A catalog locate is performed for each of a plurality of data sets on a base catalog structure (BCS), identifying a plurality of BCS entries. If a first BCS entry is cataloged incorrectly, the first BCS entry is designated to be re-cataloged. The plurality of BCS entries is compared with a plurality of volume table of contents and a plurality of VSAM volume data set (VTOC/VVDS) entries. If a second BCS entry found in the plurality of BCS entries is not found in the plurality of VTOC/VVDS entries, and the second BCS entry indicates that a data set associated with the second BCS entry is located on a volume, an attempt is made to vary on the volume. If the volume cannot be varied on, a request is created to restore the volume.

Abstract: A method of minimizing data storage medium fragmentation, wherein the method provides a data storage library comprising (N) data storage media, wherein (N) is greater than or equal to 1. The method establishes a threshold fragmentation index, and determines, for each value of (i), an actual fragmentation index for an (i)th data storage medium, wherein (i) is greater than or equal to 1 and less than or equal to (N). The method receives a data set from a host computer in communication with the data storage library, and writes the data set to an (i)th data storage medium based upon an (i)th actual fragmentation index.

Abstract: Various embodiments for intelligent dump suppression in a computing environment following an error are provided. A plurality of historical information is considered in view of a current alert level to generate an output decision. The current alert level is one of an available plurality of alert levels configurable by a user. The current alert level is selectable by the user for a predetermined data collection restrictiveness. Data capture is performed according to the output decision.

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: Data is added to a data set to cause a growth in size of the data set, wherein the data set belongs to a storage group, and wherein the data set is comprised of extents. The data set is included into a new storage group, in response to determining that the growth in the size of the data set has caused a predetermined threshold for a size limit of the storage group to be exceeded. The extents of the data set are restructured to satisfy a predetermined condition on the extents of the data set, in response to determining that the growth in the size of the data set has caused the predetermined condition on the extents included in the data set to be not satisfied.

Abstract: Method, system, and computer program product embodiments of a time-based trace facility for facilitating software debugging without interfering with the run-time behavior, performance or resource usage of the traced software are provided. The trace facility resides in a different address space than the target address space and uses different time-slices of CPU resources to execute the instructions in the address spaces. The trace facility uses a cross-memory mode to read the state data from the target address space in accordance with a time schedule. The trace facility writes the state data to a trace area, which may be located in either the target or trace address spaces or external storage. With this approach, the trace facility can read a large amount of state data frequently to construct the type of historical record needed to analysis run-time behavior, performance and resource usage.

Abstract: Method embodiments for facilitating overflow storage of special data sets that reside on a single logical volume are provided. A virtual logical volume is created from unallocated memory units across a plurality of logical volumes in a volume group. The virtual logical volume appears the same as any one of the logical volumes in the volume group to an external client. Upon receipt of a special data set that must reside in a single logical volume, an attempt is first made to allocate the special data set to one of the logical volumes in the volume group. If that allocation attempt fails, the special data set is allocated to the virtual logical volume. The virtual logical volume may be created only upon the failure to allocate the special data set to one of the logical volumes, and may be destroyed if sufficient space in one of the logical volumes is freed up to transfer the special data set.

Abstract: A method for addressing an out-of-space condition for a Virtual Storage Access Method (VSAM) Volume Data Set (VVDS) includes detecting an out-of-space condition in a VVDS on a volume. The method creates, in response to the out-of-space condition, a new VVDS on the volume without adding a record to the old VVDS (e.g., by bypassing “catalog services”). The new VVDS is assigned a temporary name. The method then copies records from the old VVDS to the new VVDS. The method may then rename the old VVDS to a temporary name and rename the new VVDS to the original name of the old VVDS. The old VVDS may then be deleted. Alternatively, instead of renaming the old VVDS to a temporary name, the old VVDS may be deleted. The new VVDS may then be renamed to the original name of the old VVDS. A corresponding apparatus and computer program product are also described.

Abstract: A method for addressing an out-of-space condition for a Virtual Storage Access Method (VSAM) Volume Data Set (VVDS) includes detecting an out-of-space condition in a VVDS on a volume. The method creates, in response to the out-of-space condition, a new VVDS on the volume without adding a record to the old VVDS (e.g., by bypassing “catalog services”). The new VVDS is assigned a temporary name. The method then copies records from the old VVDS to the new VVDS. The method may then rename the old VVDS to a temporary name and rename the new VVDS to the original name of the old VVDS. The old VVDS may then be deleted. Alternatively, instead of renaming the old VVDS to a temporary name, the old VVDS may be deleted. The new VVDS may then be renamed to the original name of the old VVDS. A corresponding apparatus and computer program product are also described.

Abstract: Various method and system embodiments for facilitating catalog sharing in multiprocessor systems use multiple ECS cache structures to which catalogs are assigned based on an attribute such as SMS storage class or a high level qualifier (HLQ) (e.g. an N-to-1 mapping) or each individual catalog (e.g. a 1-to-1 mapping). When maintenance is performed on an ECS shared catalog, the multiple ECS cache structure requires only those catalogs associated with a particular ECS cache structure be disconnected. Any catalogs in the structure that are not involved in or affected by the maintenance may be temporarily or permanently moved to a different ECS cache structure. As a result, VVDS sharing is only required for those catalogs on which maintenance is being performed or that remain associated with that ECS cache structure during maintenance. This reduces I/O activity to the DASD, and results in a significant overall performance improvement.

Abstract: A method for automatically optimizing an allocation amount for a data set includes receiving an extend request, specifying an allocation amount, for a data set in a storage pool. The method increments a counter in response to receiving the extend request. In the event the counter has reached a threshold value, the method automatically increases the allocation amount of the extend request, such as by multiplying the allocation amount by a multiplier. In the event the allocation amount is larger than a largest free extent in the storage pool, the method automatically decreases the allocation amount of the extend request to correspond to the largest available free extent. Such a method reduces or eliminates the chance that an extend request will fail, and reduces overhead associated with extending and consolidating extents. A corresponding apparatus and computer program product are also disclosed herein.

Abstract: A method for controlling access to client data by support providers is disclosed herein. In one embodiment, such a method includes initiating a session on a server computer in response to receipt of a request for assistance from a client, the session having client data associated therewith. A session key is generated for the session. The session key includes a session identifier and a support provider identifier corresponding to an assignee. The session key may further include a client identifier corresponding to the client. Requests to access the client data include an assignee key including a session identifier and a support provider identifier, and potentially a client identifier if needed. The assignee key is compared to the session key. If correspondence is found between the identifiers in the assignee key and the session key, access is granted.

Abstract: A plurality of storage subsystems and a plurality of storage devices are maintained, and wherein each storage subsystem includes at least one storage device of the plurality of storage devices. A plurality of storage groups is generated, wherein each storage group includes one or more storage devices selected from the plurality of storage devices, and wherein the one or more storage devices selected in each storage group are included in at least two different storage subsystems. The plurality of storage groups is adjusted based on: (a) usage statistics of the data, wherein the usage statistics are stored in a log file; and (b) properties and organization of the data stored in a plurality of data structures.

Abstract: A documentation inventory manager which assigns a protection key to each piece of documentation that is received. More specifically, when providing information to a receiving company, a client provides their files to a common FTP server. As a support team of the receiving company accesses the files and stores some or all of the files to a local storage system, the files are modified to include an imbedded header record. In certain embodiments, the imbedded header record includes information regarding an original file name sent by the client, a key value that is assigned to that version of the downloaded file, permissions such as whether the file can be copied, and the inventory manager location. Each time a version of the file is downloaded to a different location within the receiving company, that file name, location, and new unique key is updated in the documentation inventory manager.

Abstract: A method for controlling access to client data by support providers includes initiating a session on a server computer in response to receipt of a request for assistance from a client, the session having client data associated therewith. A session key is generated for the session. The session key includes a session identifier and a support provider identifier corresponding to an assignee. The session key may further include a client identifier corresponding to the client. Requests to access the client data include an assignee key including a session identifier and a support provider identifier, and potentially a client identifier if needed. The assignee key is compared to the session key. If correspondence is found between the identifiers in the assignee key and the session key, access is granted. A corresponding apparatus and computer program product are also described.

Abstract: A method for optimizing a plurality of volume records stored in cache may include monitoring a volume including multiple data sets, wherein each data set is associated with a volume record, and each volume record is stored in a volume record data set. The method may include tracking read and write operations to each of the data sets over a period of time. The method may further include reorganizing the volume records in the volume record data set such that volume records for data sets with a larger number of read operations relative to write operations are grouped together, and volume records for data sets with a smaller number of read operations relative to write operation are grouped together. A corresponding apparatus and computer program product are also disclosed.

Abstract: In a computer-implemented data storage system comprising at least one storage control and data storage, wherein data is stored in the form of volumes, at least a plurality of volumes having at least some freespace, and a grouping of a plurality of volumes comprises a pool. In response to a defragmentation request, the storage control initiates migration of data from a pool to generate additional freespace. Subsequent to the migration of data, fragmentation of data of the pool is computed, and the amount of existing freespace of the pool is determined. The amount of existing freespace is compared to a freespace threshold, where the freespace threshold is related to the computed fragmentation. If the comparison indicates the amount of freespace is below the threshold, spill volumes are added to the pool; and, else, the pool is kept intact without adding spill volumes. Then, defragmentation of the pool is initiated.

Abstract: In a computer-implemented data storage system comprising at least one storage control and data storage, wherein data is stored in the form of volumes, at least a plurality of volumes having at least some freespace, and a grouping of a plurality of volumes comprises a pool. In response to a defragmentation request, the storage control initiates migration of data from a pool to generate additional freespace. Subsequent to the migration of data, fragmentation of data of the pool is computed, and the amount of existing freespace of the pool is determined. The amount of existing freespace is compared to a freespace threshold, where the freespace threshold is related to the computed fragmentation. If the comparison indicates the amount of freespace is below the threshold, spill volumes are added to the pool; and, else, the pool is kept intact without adding spill volumes. Then, defragmentation of the pool is initiated.

Abstract: A method to optimize use of available storage capacity of a plurality of sequential data storage media, wherein the method provides (M) sequential data storage media each comprising a plurality of blockids, where the (i)th sequential data storage medium comprises an (i)th available storage capacity, and where (M) is greater than or equal to 2, and where (i) is greater than or equal to 1 and less than or equal to (M). The method then receives source data comprising a plurality of segments, determines a quantum of data to store, determines if the quantum of data to store is substantially equal to an (i)th available storage capacity. If the quantum of data to store is substantially equal an (i)th available storage capacity, then the method writes the source data to an (i)th sequential data storage medium.

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.