Abstract: Provided are computer program product, system, and method for using inactive copy relationships to resynchronize data among n storages referenced as storages 1 through n, wherein n is greater than or equal to three. n?1 active copy relationships are established. Each active copy relationship copies data from one of the storages 1 through n?1 as a source storage to one other of the storages 2 through n as a target storage respectively. At least one inactive copy relationship is established to copy data from one of the storages 1 through n?1 as the source storage to one other of the storages 2 through n as a target storage, such that the source and target storages in the inactive copy relationship are not both also in a same of at least one of the active copy relationships.

Abstract: Provided are a computer program product, system, and method for using inactive copy relationships to resynchronize data between storages. A first and second groups of active copy relationships are established to serially copy data among the storages in the first and second groups, respectively. At least one of the storages in both the first group and the second group comprise overlapping storages that are members of both the first and second groups and at least one of the storages in both the first and second groups comprise non-overlapping storages that are a member of only one of the first and second groups. At least one inactive copy relationship is established having as a source storage one of the non-overlapping storages in the first group and as a target storage one of the non-overlapping storages in the second group.

Abstract: Provided are a computer program product, system, and method for maintaining inactive copy relationships for secondary storages of active copy relationships having a common primary storage for use in case of a failure of the common primary storage. A plurality of active copy relationships are established, each having a common primary storage and one of a plurality of secondary storages. For each possible pair of secondary storages in the active copy relationships, an inactive copy relationship is established to copy data from a first of the secondary storages in the pair to a second of the secondary storages in the pair. In response to a failure of the common primary storage in the active copy relationship, a new active copy relationship is established having a primary and secondary storages from a selected one of the inactive copy relationships.

Abstract: Provided are a computer program product, system, and method for concurrently processing parts of cells of a data structure with multiple processes. Information is provided to indicate a partitioning of the cells of the data structure into a plurality of parts, and having a cursor pointing to a cell in the part. Processes concurrently process different parts of the data structure by performing: determining from the cursor for the part one of the cells in the part to process; processing the cells from the cursor to determine whether to process the unit of work corresponding to the cell; and setting the cursor to identify one of the cells from which processing is to continue in a subsequent iteration in response to processing the units of work for a plurality of the processed cells.

Abstract: Methods, systems, and computer storage mediums including a computer program product method for formatting storage volumes are provided. One method includes creating a storage volume including a global counter and partitioned into multiple storage segments including a segment counter and partitioned into multiple stripes, wherein the global counter and each segment counter match at an initial time. The method further includes receiving a command to write data to a first stripe, comparing a first segment counter associated with the segment, determining if the segment and global counters match, and re-initializing first metadata associated with the segment to indicate the first segment requires formatting if the counters do not match. One system includes a processor for performing the above method and one computer storage medium includes a computer program product configured to perform the above method.

Abstract: Embodiments for managing read-only memory. A system includes a memory device including a real memory and a tracking mechanism configured to track relationships between multiple virtual memory addresses and real memory. The system further includes a processor configured to perform the below method and/or execute the below computer program product. One method includes mapping a first virtual memory address to a real memory in a memory device and mapping a second virtual memory address to the real memory.

Abstract: Systems and methods for initializing a memory system are provided. One system includes a processor and a memory including a storage volume coupled to the processor. The storage volume includes a first bitmap for tracking an initialization process for the storage volume and a second bitmap for tracking a copying process for the storage volume. A method includes performing, via the processor, an initialization process for the storage volume and tracking, via the processor utilizing the first bitmap, the initialization process. The method further includes performing, via the processor, a copying process for the storage volume prior to completing the initialization process and tracking, via the processor utilizing the second bitmap, the copying process. Also provided are computer storage mediums including computer program code for performing the above method.

Abstract: Embodiments for managing read-only memory. A system includes a memory device including a real memory and a tracking mechanism configured to track relationships between multiple virtual memory addresses and real memory. The system further includes a processor configured to perform the below method and/or execute the below computer program product. One method includes mapping a first virtual memory address to a real memory in a memory device and mapping a second virtual memory address to the real memory.

Abstract: Systems and methods for initializing a memory system are provided. One system includes a processor and a memory including a storage volume coupled to the processor. The storage volume includes a first bitmap for tracking an initialization process for the storage volume and a second bitmap for tracking a copying process for the storage volume. A method includes performing, via the processor, an initialization process for the storage volume and tracking, via the processor utilizing the first bitmap, the initialization process. The method further includes performing, via the processor, a copying process for the storage volume prior to completing the initialization process and tracking, via the processor utilizing the second bitmap, the copying process. Also provided are computer storage mediums including computer program code for performing the above method.

Abstract: Provided are a computer program product, system, and method for maintaining inactive copy relationships for secondary storages of active copy relationships having a common primary storage for use in case of a failure of the common primary storage. A plurality of active copy relationships are established, each having a common primary storage and one of a plurality of secondary storages. For each possible pair of secondary storages in the active copy relationships, an inactive copy relationship is established to copy data from a first of the secondary storages in the pair to a second of the secondary storages in the pair. In response to a failure of the common primary storage in the active copy relationship, a new active copy relationship is established having a primary and secondary storages from a selected one of the inactive copy relationships.

Abstract: Embodiments for managing read-only memory. A system includes a memory device including a real memory and a tracking mechanism configured to track relationships between multiple virtual memory addresses and real memory. The system further includes a processor configured to perform the below method and/or execute the below computer program product. One method includes mapping a first virtual memory address to a real memory in a memory device and mapping a second virtual memory address to the real memory. Here, the first virtual memory address is authorized to modify data in the real memory and the second virtual memory address is not authorized to modify the data in the real memory.

Abstract: Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.

Abstract: Provided are a computer program product, system, and method for using queues corresponding to attribute values associated with units of work to select the units of work to process. A plurality of queues for each of a plurality of attribute types of attributes are associated with the units of work to process, wherein there are queues for different possible attribute values for each of the attribute types. A unit of work to process is received. A determination is made for each of the attribute types at least one of the queues corresponding to at least one attribute value for the attribute type associated with the received unit of work. A record for the received unit of work is added to each of the determined queues.

Abstract: Provided are a computer program product, system, and method for using queues corresponding to attribute values associated with units of work and sub-units of the unit of work to select the units of work and their sub-units to process. There are a plurality of work unit queues, each associated with different work unit attribute values that are associated with units of work, wherein the work unit queues include records for units of work to process having work unit attribute values associated with the work unit attribute values of the work unit queues. There are a plurality of work sub-unit queues, wherein each are associated with different work sub-unit attribute values that are associated with sub-units of work. Records are added for work sub-units of a unit of work to the work sub-unit queues, and records are selected from the work sub-unit queues to process the sub-units of work.

Abstract: Provided are a computer program product, system, and method for using queues corresponding to attribute values and priorities associated with units of work and sub-units of the unit of work to select the units of work and their sub-units to process. There are a plurality of work unit queues, wherein each of the work unit queues are associated with different work unit attribute values that are associated with units of work, wherein a plurality of the work unit queues include records for units of work to process having work unit attribute values associated with the work unit attribute values of the work unit queues, and wherein the work unit queues are each associated with a different priority. A record for a unit of work to perform is added to the work unit queue associated with a priority and work unit attribute value associated with the work unit.

Abstract: Provided are a computer program product, system, and method for concurrently processing parts of cells of a data structure with multiple processes. Information is provided to indicate a partitioning of the cells of the data structure into a plurality of parts, and having a cursor pointing to a cell in the part. Processes concurrently process different parts of the data structure by performing: determining from the cursor for the part one of the cells in the part to process; processing the cells from the cursor to determine whether to process the unit of work corresponding to the cell; and setting the cursor to identify one of the cells from which processing is to continue in a subsequent iteration in response to processing the units of work for a plurality of the processed cells.

Abstract: Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.

Abstract: Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.

Abstract: A storage controller receives a request to establish a point-in-time copy operation by placing a space efficient source volume in a point-in-time copy relationship with a space efficient target volume, wherein subsequent to being established the point-in-time copy operation is configurable to consistently copy the space efficient source volume to the space efficient target volume at a point in time. A determination is made as to whether any track of an extent is staging into a cache from the space efficient target volume or destaging from the cache to the space efficient target volume. In response to a determination that at least one track of the extent is staging into the cache from the space efficient target volume or destaging from the cache to the space efficient target volume, release of the extent from the space efficient target volume is avoided.

Abstract: Embodiments for managing read-only memory. A system includes a memory device including a real memory and a tracking mechanism configured to track relationships between multiple virtual memory addresses and real memory. The system further includes a processor configured to perform the below method and/or execute the below computer program product. One method includes mapping a first virtual memory address to a real memory in a memory device and mapping a second virtual memory address to the real memory. Here, the first virtual memory address is authorized to modify data in the real memory and the second virtual memory address is not authorized to modify the data in the real memory.