International Business Machines Corporation

Sap Ag

Sheli Rahav

Ifat Nuriel

Shachar Fienblit

Gail Andrea Spear

Dalit Tzafrir

Rivka Mayraz Matosevich

William Frank Micka

Amiram Hayardeny

Sivan Tal

Michael Edward Factor

Warren Keith Stanley

Sam Clark Werner

Thomas Charles Jarvis

Svetlana Shukevich

Eitan D Farchi

Robert Francis Bartfai

Matthew Sanchez

Theresa Mary Brown

Aviad Zlotnick

Orna Raz-Pelleg

Rivka Mayraz Matsoevich

Dalit Tzafir

Sivan Tai

Shay Gammer

An apparatus for optimizing a transaction comprising an initial sequence of computer operations, the apparatus includes a processing unit which identifies one or more idempotent operations comprised within the initial sequence, and which reorders the initial sequence to form a reordered sequence comprising a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations, the second sub-sequence comprising only the one or more idempotent operations.

Using idempotent operations to improve transaction performance

Preparation of a snapshot for data storage includes receiving a first command to prepare to create a snapshot of a set of data stored on at least one source storage volume in a data storage system. The data storage system is prepared to expedite creation of the snapshot in response to the first command. A second command to create the snapshot is received subsequent to the first command. The snapshot is created, in response to the second command, by copying the set of data onto at least one target storage volume at an event time. The set of data may comprise a consistency group comprising a set of data blocks, and preparing the system to create the snapshot may include reserving resources, throttling an incoming data rate, starting a timer after receiving the first command, and/or copying data from a plurality of storage volumes into a memory cache.

Efficiently creating a snapshot of a large consistency group using multiple commands including a snapshot preparation command

A method for evaluating a debugger script, the method includes: (i) receiving a debugger script that includes a first debugger breakpoint that is associated with a certain program line number; and determining a validity of the first debugger breakpoint in response to a comparison between expected content associated with the first debugger breakpoint and between an actual content of at least a portion of a certain program line group that comprises a certain program line identified by the certain program line number.

Device, method and computer program product for evaluating a debugger script

Techniques are provided for performing a copy operation. A fast reverse restore command indicating a new source and a new target is received, wherein the new source is an original target and the new target is an original source. A synchronous scan is performed on the new target. A new target structure associated with the new target is updated using a new source structure associated with the new source. Techniques are also provided for performing a copy operation in which a fast reverse restore command is received after an instant virtual copy has been performed from a new target to a new source and wherein the fast reverse restore command is performed before a background copy has been performed by the instant virtual copy.

Data storage system for fast reverse restore

Provided are a system and article of manufacture for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.

System and article of manufacture for consistent copying of storage volumes

Article of manufacture and system for fast reverse restore

A method for optimizing a transaction consisting of an initial sequence of computer operations, the method including identifying one or more idempotent operations in the initial sequence. The method further includes reordering the initial sequence to form a reordered sequence consisting of a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations. The second sub-sequence has only the one or more idempotent operations.

Provided is a method for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.

Method for consistent copying of storage volumes

Method for fast reverse restore

Provided are a method, system, and article of manufacture for copying storage. Copy operations are performed on source storage units to copy to target storage units, wherein the copy operations create a consistent copy of the source storage units in the target storage units. While performing a copy operation to copy from one source storage unit to one target storage unit, a write operation is restricted from being performed on the one source storage unit, until the copy operations have been performed on the source storage units.

Method, system, and article of manufacture for consistent copying of storage volumes

Provided are a method, system, and program for managing a relationship between one target volume and one source volume. For each of the source volume and target volume, the memory includes: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element; and (iv) one relationship pointer for each relationship entry associating the relationship entry with volume metadata, wherein the volume metadata provides information on the relationship represented by the relationship entry.

Method, system, and program for managing a relationship between one target volume and one source volume

Provided are a method, system, and program for managing a relationship between one target volume and one source volume. Information is maintained in memory on an existing relationship between at least one source volume and at least one target volume, comprising: (i) at least one element, wherein each element represents a range of sequential data units in the volume; (ii) at least one relationship entry, wherein each relationship entry represents one relationship; and (iii) at least one element pointer associating one element with one relationship entry, wherein the data units represented by the element are part of the relationship represented by the relationship entry that the pointer associates with the element. A new relationship between at least one target volume and at least one source volume is added. Further, added is a new relationship entry in the memory representing the new relationship and one new element pointer is added in the memory for each element including data units included in the new relationship to associate the element with the new relationship entry, wherein the data units represented by the element are part of the new relationship.

Method, system, and program for managing information on relationships between target volumes and source volumes when performing adding, withdrawing, and disaster recovery operations for the relationships

Disclosed is a technique for applying changes back to an original copy of data to reduce an amount of data transferred. A first indicator is maintained for each block of data in a first storage to indicate whether the block of data has been updated in the first storage since the block of data was last transferred to a second storage. A second indicator is maintained for each block of data in the second storage to indicate whether the block of data has been updated in the second storage since the block of data in the second storage was overwritten by a corresponding block of data in the first storage. Upon receiving a reverse restore operation, each block of data in the second storage for which a second indicator has been set to indicate that the block of data has been updated is transferred to the first storage and each block of data in the second storage that corresponds to a block of data in the first storage for which a first indicator has been set to indicate that the block of data in the first storage has been updated is transferred to the first storage.

Method, system, and program for reverse restore of an incremental virtual copy

Disclosed is a technique for reducing an amount of data transferred. A first indicator is maintained for each source block of data to indicate whether the source block of data has been updated in source storage since the source block of data was last transferred to target storage. A second indicator is maintained for each target block of data in target storage to indicate whether the target block of data has been updated in target storage since the target block of data was overwritten by a corresponding source block of data. When transferring data from the source storage to the target storage, each source block of data for which a first indicator has been set to indicate that the source block of data has been updated is transferred and each source block of data that corresponds to a target block of data for which a second indicator has been set to indicate that the target block of data has been updated is transferred.

Growing community of inventors

Haifa, Israel

Sheli Rahav