Abstract: A system, method, and computer program product for managing storage volumes. A processor creates a first point-in-time copy cascade, where the first point-in-time copy cascade comprises a source volume, a first snapshot point-in-time copy volume, and a second snapshot point-in-time copy volume; the first volume is a snapshot copy of the source volume and the second volume is a snapshot copy of the first volume. A processor creates a third snapshot point-in-time copy volume from the first volume. A processor maps the third volume to create a second cascade, wherein the second cascade comprises the source volume, the first volume, and the third volume but not the second volume. A processor directs an I/O operation for the first copy volume to the third volume.

Abstract: A system, method, and computer program product for managing storage volumes. A processor creates a first point-in-time copy cascade, where the first point-in-time copy cascade comprises a source volume, a first snapshot point-in-time copy volume, and a second snapshot point-in-time copy volume; the first volume is a snapshot copy of the source volume and the second volume is a snapshot copy of the first volume; and the source volume, the first volume, and the second volume include a host portion. A processor creates a third snapshot point-in-time copy volume from the first volume. A processor maps the third volume to create a second cascade, wherein the second cascade comprises the source volume, the first volume, and the third volume but not the second volume. A processor directs an I/O operation for the first copy volume to the third volume.

Abstract: An apparatus, method and computer program in a distributed cluster storage network comprises storage control nodes to write data to storage on request from a host; a forwarding layer at a first node to forward data to a second node; a buffer controller at each node to allocate buffers for data to be written; and a communication link between the buffer controller and the forwarding layer at each node to communicate a constrained or unconstrained status indicator of the buffer resource to the forwarding layer. A mode selector selects a constrained mode of operation requiring allocation of buffer resource at the second node and communication of the allocation before the first node can allocate buffers and forward data, or an unconstrained mode of operation granting use of a predetermined resource credit provided by the second to the first node and permitting forwarding of a write request with data.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first target volume and a second target volume. The method detects a corruption of the first source volume and, if a first restoration of the first source volume from the first target volume is in progress, creates a third target volume from the second target volume and directs I/O operations for the first source volume to the third target volume. The first source volume is then restored from the third target volume.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first point-in-time target volume, and a second point-in-time target volume. The second point-in-time target volume is a point-in-time copy of the first point-in-time target volume. Upon detecting a corruption of the first point-in-time target volume the method creates a third point-in-time target volume from the second point-in-time target volume and directs I/O operations for the first point-in-time target volume to the third point-in-time target volume. The first point-in-time target volume is restored to the second point-in-time target volume and, when the restoration is complete, deletes the first point-in-time target volume.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first clone point-in-time target volume, and a second point-in-time target volume that is a point-in-time copy of the first point-in-time target volume. Grain background copies from the first source volume to the first clone point-in-time target volume are tracked, and, if the first clone point-in-time target volume is corrupted, a third point-in-time target volume is created from the second point-in-time target volume. I/O for the first clone point-in-time target volume is directed to the third point-in-time target volume. The first clone point-in-time target volume is cleaned to the second point-in-time target volume. The first clone point-in-time target volume is restarted from the third point-in-time target volume and each grain of the first clone point-in-time target volume that has not been background copied is copied from the cascade to the first clone point-in-time target volume.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first target volume and a second target volume. The method detects a corruption of the first source volume and, if a first restoration of the first source volume from the first target volume is in progress, creates a third target volume from the second target volume and directs I/O operations for the first source volume to the third target volume. The first restoration is stopped. The first source volume is restored from the third target volume, and the third target volume is deleted.

Abstract: Delay in the allocation of resources can be measured for a set of sequential requests for the resources. A start time for the receipt of the first request of the set can be recorded, followed by the incrementing of a request start time counter, with the current time minus the recorded start time, for each subsequently received request. A total time counter can be incremented, with the current time minus recorded start time, for each request allocation, and a request counter can be incremented for each request allocation. When determining that all received requests have been allocated, and decrementing the total time counter by the request start time counter, it is possible to determine an average delay time from the total time counter value divided by the request counter value.

Abstract: A system, method, and computer program product for managing storage volumes in a point-in-time copy cascade. A processor swaps a host portion of a source volume with a host portion of a snapshot point-in-time copy volume. Responsive to an I/O request to overwrite a first data value in a grain of the source volume with a second data value, a processor writes the second data value in a corresponding grain of the snapshot point-in-time copy volume. Responsive to a corresponding grain of a clone point-in-time copy volume not comprising the first data value, a processor copies the first data value to the corresponding grain of the clone point-in-time copy volume.

Abstract: A system, method, and computer program product for managing storage volumes. A processor creates a first point-in-time copy cascade, where the first point-in-time copy cascade comprises a source volume, a first snapshot point-in-time copy volume, and a second snapshot point-in-time copy volume; the first volume is a snapshot copy of the source volume and the second volume is a snapshot copy of the first volume; and the source volume, the first volume, and the second volume include a host portion. A processor creates a third snapshot point-in-time copy volume from the first volume. A processor maps the third volume to create a second cascade, wherein the second cascade comprises the source volume, the first volume, and the third volume but not the second volume. A processor directs an I/O operation for the first copy volume to the third volume.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first clone point-in-time target volume, and a second point-in-time target volume that is a point-in-time copy of the first point-in-time target volume. Grain background copies from the first source volume to the first clone point-in-time target volume are tracked, and, if the first clone point-in-time target volume is corrupted, a third point-in-time target volume is created from the second point-in-time target volume. I/O for the first clone point-in-time target volume is directed to the third point-in-time target volume. The first clone point-in-time target volume is cleaned to the second point-in-time target volume. The first clone point-in-time target volume is restarted from the third point-in-time target volume and each grain of the first clone point-in-time target volume that has not been background copied is copied from the cascade to the first clone point-in-time target volume.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first target volume and a second target volume. The method detects a corruption of the first source volume and, if a first restoration of the first source volume from the first target volume is in progress, creates a third target volume from the second target volume and directs I/O operations for the first source volume to the third target volume. The first restoration is stopped. The first source volume is restored from the third target volume, and the third target volume is deleted.

Abstract: Managing storage volumes in a point-in-time copy cascade. The cascade includes a first source volume, a first point-in-time target volume, and a second point-in-time target volume. The second point-in-time target volume is a point-in-time copy of the first point-in-time target volume. Upon detecting a corruption of the first point-in-time target volume the method creates a third point-in-time target volume from the second point-in-time target volume and directs I/O operations for the first point-in-time target volume to the third point-in-time target volume. The first point-in-time target volume is restored to the second point-in-time target volume and, when the restoration is complete, deletes the first point-in-time target volume.

Abstract: Provided are a system, method, and computer program product for controlling access to a shared storage system in communication with at least one cluster of host nodes. Cluster membership metadata is stored in a storage independent from the shared storage for at least one cluster. The cluster membership metadata is updated in response to an inclusion or exclusion request from a requesting host node comprising one of the host nodes identifying at least one other host node to include or exclude from a cluster. Access to at least one storage volume in the shared storage system is managed in response to the updating of the cluster membership metadata for the inclusion or exclusion request.

Abstract: Disclosed is a system for replicating data. The system may comprise a plurality of nodes preferably organized in groups with one of the nodes acting as a coordinator node. The nodes are configured to receive write requests from an external server and to apply these write requests to a data storage source of the data storage system. The write requests typically belong to a batch of independent write actions identified by a batch sequence number. Each node stores the write request in non-volatile memory with the coordinator node monitoring which batches are secured in their entirety in non-volatile memory. The coordinator node authorizes all other nodes to sequentially replicate the write requests in their non-volatile memory to the data storage source for all writes up to the highest batch sequence number for which all writes have been secured in non-volatile memory.

Abstract: A method includes monitoring port login requests initiated by elements of a storage system, the storage system comprising interconnection cabling, constructing a connection graph corresponding to the port login requests, wherein each edge of the connection graph corresponds to a specific port login request and each vertex of the connection graph corresponds to a port within the storage system, and using the connection graph to evaluate the interconnection cabling of the storage system. A corresponding computer program product and computer system are also disclosed herein.

Abstract: An apparatus, method and computer program in a distributed cluster storage network comprises storage control nodes to write data to storage on request from a host; a forwarding layer at a first node to forward data to a second node; a buffer controller at each node to allocate buffers for data to be written; and a communication link between the buffer controller and the forwarding layer at each node to communicate a constrained or unconstrained status indicator of the buffer resource to the forwarding layer. A mode selector selects a constrained mode of operation requiring allocation of buffer resource at the second node and communication of the allocation before the first node can allocate buffers and forward data, or an unconstrained mode of operation granting use of a predetermined resource credit provided by the second to the first node and permitting forwarding of a write request with data.

Abstract: A data storage system comprises a controller, a first lower performance storage medium and a second higher performance storage medium. The controller is connected to the storage mediums and is arranged to control Input/Output (IO) access to the storage mediums. In operation, the controller is arranged to store an image on the first storage medium, initiate a copy function from the first storage medium to the second storage medium, direct all IO access for the image to the second storage medium, and periodically age data from the second storage medium to the first storage medium.

Abstract: Delay in the allocation of resources can be measured for a set of sequential requests for the resources. A start time for the receipt of the first request of the set can be recorded, followed by the incrementing of a request start time counter, with the current time minus the recorded start time, for each subsequently received request. A total time counter can be incremented, with the current time minus recorded start time, for each request allocation, and a request counter can be incremented for each request allocation. When determining that all received requests have been allocated, and decrementing the total time counter by the request start time counter, it is possible to determine an average delay time from the total time counter value divided by the request counter value.

Abstract: A mechanism is provided for recovering a data backup comprising a data image and a point-in-time copy of the data image. A virtual data image storage device is provide for storing a copy of the data image, and a virtual snapshot storage device is provided for storing data of the point-in-time copy. The data image is copied to the virtual data image storage device, and data from the point-in-time copy of the data image is copied to the virtual snapshot storage device responsive to the data not existing in the virtual data image storage device.