Abstract: A technique for performing configuration checking of a network is provided. A network data store is scanned for at least one transaction. At least one event is generated for the transaction. At least one configuration policy is associated with the event. The configuration policy is compared with configuration data associated with the event. It is determined whether the configuration policy has been violated based on the comparison.

Abstract: Techniques are provided for locating data. Mapping information for blocks associated with a file is provided. It is determined that a copy service has copied source blocks to target blocks. It is determined whether the mapping information should be updated to refer to the target blocks. Then, updated mapping information is provided in response to determining that the mapping information should be updated to refer to the target blocks.

Abstract: Disclosed is a system, method, and program for distributing computer software from a first computer system. The first computer system receives a request for software from a second computer system. In response, the first computer system generates a message, encrypts the generated message, and transmits the encrypted message to the second computer system. The first computer system later receives an encrypted response from the second computer system and processes the encrypted response to determine whether the second computer system is authorized to access the software. The second computer system is permitted access to the software after determining that the second computer system is authorized to access the software. To access the computer software with the second computer system, the second computer system transmits a request for the software to the first computer system.

Abstract: A computer program for automatically pairing target resources 20 such as volumes or logical units to source resources 20 containing data to be copied. Available target pools 48, 50, 52, 54 of target volumes are determined eligible for copying based on a technical compatibility and a user-defined metric such as recovery point or recovery time. User defined metrics and a policy to implement the metrics may be stored in a medium and selected by a user. The source volumes are prioritized, and progressively larger segments of the eligible target pools are searched for a target volume that satisfies the technical compatibility and user-defined metric. Where subgroups such as nested volumes are present in the source volumes, subgroups are also prioritized for searching. Where no target volume can be paired, the corresponding source volume is marked as processed and a search begins for the next source volume.

Abstract: Techniques are provided for resolving a collision between two copy services. A policy associated with a new copy service request is retrieved. Characteristics of an existing copy service request are determined. The effects of the new copy service request are determined. A resolution for the collision is identified based on the policy, the determined characteristics, and the determined effects.

Abstract: A system and method for remapping a game wheel are disclosed. In one embodiment, a wagering game comprises a wheel divided into a plurality of wheel segments, wherein particular weights are assigned to one or more of the wheel segments. A memory means stores two or more maps, wherein each map defines a particular weight for one or more of the wheel segments on the game wheel. A remapping means selects a map from the memory means and assigns a weight to one or more of the wheel segments as defined by the selected map.

Abstract: Provided are a method, system, and article of manufacture for copying storage. A request is received from a host application to copy a plurality of source storage units. A list of potential target storage units is determined based on a policy. Potential target storage units that are eligible for fast replication are selected from the determined list, wherein the selection of the potential target storage units for fast replication includes determining whether a storage unit in the list of potential target storage units is eligible for fast replication by processing an attribute associated with the storage unit.

Abstract: Provider are a method, system, and program for maintaining data in a distributed computing environment. Data is stored at a primary storage site. A data structure is processed indicating an association of data sets in the stored data, secondary storage sites, and update frequencies. In response to processing the data structure, a determination is made of one of a plurality of secondary storage sites and a determination is made of at least one data set to transmit to the determined secondary storage site at an update frequency. The determined data set is transmitted to the determined secondary storage site according to the update frequency.

Abstract: An apparatus and method for transporting containers to be processed in a manufacturing operation includes a transfer assembly that transfers containers from a load area on an upstream conveyor assembly to a discharge on downstream conveyor assembly for further processing. The upstream conveyor assembly may include longitudinally extending first and second conveyors oriented at an angle to one another. The transfer assembly may include a rotating wheel that picks containers from a chute and moves them, one at a time, to the downstream conveyor assembly. The downstream conveyor assembly may be in the form of an elevator that has bays that are sized to receive individual containers. The bays are formed by vanes on a moving belt. The method includes steps inherent in the structure, including receiving a bulk supply of containers, moving them horizontally, columnizing them into a single file, elevating them and thereafter discharging them.

Abstract: In a system including a host, a primary storage subsystem coupled to the host, a cache coupled to the host and separate from the primary storage system, a secondary storage subsystem, and a data mover coupling the primary and secondary storage systems, data is temporarily cached for future storage in the primary storage subsystem so as to preserve timestamp information and maintain data consistency for asynchronously mirroring the data at a secondary subsystem.

Abstract: Provided are a method, system, and article of manufacture for copying storage. A request is received from a host application to copy a plurality of source storage units. A list of potential target storage units is determined based on a policy. Potential target storage units that are eligible for fast replication are selected from the determined list, wherein the selection of the potential target storage units for fast replication includes determining whether a storage unit in the list of potential target storage units is eligible for fast replication by processing an attribute associated with the storage unit.

Abstract: In a system including a host, a primary storage subsystem coupled to the host, a cache coupled to the host and separate from the primary storage system, a secondary storage subsystem, and a data mover coupling the primary and secondary storage systems, data is temporarily cached for future storage in the primary storage subsystem so as to preserve timestamp information and maintain data consistency for asynchronously mirroring the data at a secondary subsystem.

Abstract: Provider are a method, system, and program for maintaining data in a distributed computing environment. Data is stored at a primary storage site. A data structure is processed indicating an association of data sets in the stored data, secondary storage sites, and update frequencies. In response to processing the data structure, a determination is made of one of a plurality of secondary storage sites and a determination is made of at least one data set to transmit to the determined secondary storage site at an update frequency. The determined data set is transmitted to the determined secondary storage site according to the update frequency.

Abstract: Disclosed is a method, system, program, and data structures for maintaining electronic data at a point-in-time. A first data structure indicates point-in-time data at one of a first storage location and a corresponding second storage location. A second data structure indicates point-in-time data at one of a first storage location and corresponding second storage location. A first relationship data structure indicates a relationship between the first storage location and corresponding second storage location and a second relationship data structure indicates a relationship between the first storage location and second storage location. A request to process the first storage location is processed by processing the first relationship data structure to determine the corresponding second storage location for the first storage location and processing the first data structure to determine whether data at the first storage location was transferred to the second storage location.

Abstract: Provided is a method, system, and program for releasing storage space in a first and second storage devices. Updates to the first storage device are copied to the second storage device to provide secondary storage for the updates. A first and second tables map data sets to addresses in the first and second storage devices, respectively. A first command is detected to invalidate data sets in the first table. The addresses in the first table comprise virtual addresses, and a third table provides a mapping of the virtual addresses to physical storage locations in the first storage device. A second command is generated to update the second table to invalidate the data sets in the second storage device invalidated in the first table by the first command. A third command is detected to invalidate the virtual addresses in the third table used by the data sets invalidated in the first table to free the physical storage locations in the first storage device pointed to by the invalidated virtual addresses.

Abstract: Disclosed is a method, system, program, and memory for erasing data. A request to erase data at least one storage location is received. In response, a data structure is generated indicating that each storage location subject to the erase request is in an erased state. Upon processing a request to access a storage location, a determination is made as to whether the requested storage location is indicated in the data structure. The data structure is processed to determine whether the requested storage location is in the erased state after determining that the requested storage location is indicated in the data structure. Access to the data at the requested storage location is denied after determining that the requested storage location is in the erased state.

Abstract: A multi-session data storage facility coordinates similar status changes across all sessions at appropriate times. In each session, a data mover implements data mirroring by copying updates from the primary storage to the secondary storage. A master data set, accessible by all sessions, includes a common area for posting commands and/or errors to all sessions and individual session areas for posting errors occurring in particular sessions. When a data mover receives a host initiated command, this data mover becomes a “master.” Initially, the master data mover lists the command in the master data set's common area. Whenever other, “slave” data movers notice a command in the master data set's common area, they respond by suspending their formation of consistency groups and responding with a “ready” message. The “ready” message comprises the slave data mover's consistency form time (i.e.

Abstract: A system, method, and program for maintaining data consistency among updates to data storage areas are provided. Each update has an update time the update was made. There are multiple groups of data storage areas. For each group, updates to the data storage area in the group are stored in a journal for storing updates to the group, wherein there are multiple journals. An indication is made in a memory area for each group of a group update time comprising a most recent update time of the updates in the group. The update time for each update in the group is not greater than the group update time. A determination is made of a minimum group update time across all the groups. At least one update is applied to storage if the update time for the update does not exceed the minimum group update time. The data storage areas may be partitioned among a plurality of computer systems, and may be maintained in at least one primary and secondary storage.

Abstract: Provided is a method, system, and program for releasing storage space in a first and second storage devices. Updates to the first storage device are copied to the second storage device to provide secondary storage for the updates. A first and second tables map data sets to addresses in the first and second storage devices, respectively. A first command is detected to invalidate data sets in the first table. The addresses in the first table comprise virtual addresses, and a third table provides a mapping of the virtual addresses to physical storage locations in the first storage device. A second command is generated to update the second table to invalidate the data sets in the second storage device invalidated in the first table by the first command. A third command is detected to invalidate the virtual addresses in the third table used by the data sets invalidated in the first table to free the physical storage locations in the first storage device pointed to by the invalidated virtual addresses.

Abstract: Disclosed is a method, system, program, and memory for erasing data. A table is provided indicating different groupings of system functions. Each grouping indicates at least one system function. For each grouping there is code to perform erase operations. An erase command to erase data in at least one storage location is received. A determination is then made of the grouping having system functions supported by the system and the table is processed to determine the code for the determined grouping. The code for the determined grouping is executed to perform erase operations with respect to each storage location.