Joshua J Rhoades

US Patent:

8548949, Oct 1, 2013

Filed:

May 30, 2012

Appl. No.:

13/483865

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua M. Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/00

US Classification:

707649, 707690, 707803

Abstract:

A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods for dynamic consistency group formation are also described.

US Patent:

8554737, Oct 8, 2013

Filed:

Sep 28, 2010

Appl. No.:

12/892808

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua M. Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/00

US Classification:

707649, 707690, 707803

Abstract:

In one embodiment, a system, includes logic for creating a snapshot of first data stored on a source storage system, wherein the snapshot is a logical copy of the first data stored on the source storage system with respect to data content and data structure; logic for copying the snapshot to a target storage system; logic for copying the first data represented by the snapshot from the source storage system to the target storage system; logic for detecting one or more write operations affecting data on the source storage system; logic for detecting one or more collisions affecting the first data on the source storage system, logic for setting a consistency group interval; and logic for altering the consistency group interval to minimise collisions affecting data on the source storage system. Other systems and computer program products for dynamic consistency group formation are also described.

US Patent:

8572339, Oct 29, 2013

Filed:

Nov 19, 2010

Appl. No.:

12/950726

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua Marshall Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/16

US Classification:

711162, 711161

Abstract:

In one aspect of the present description, a data preservation function is provided for preserving a set of data on a source storage device at a point in time, and includes identifying as a function of prior update usage, such as input/output usage, of the data to be preserved, a portion of the data which is more likely to be the subject of updates during at least a portion of the data preservation operation as compared to the remaining portion of the data to be preserved, and copies the identified portion of the data to be preserved to a target storage device. In another aspect, the size of the portion of data to be identified is variable. In one embodiment, the size of the portion of data to be identified is a function of a parameter of the command, such that a user can specify the command parameter which affects the size of the portion of data which is prewritten to the target storage device. The parameter may be, for example, a percentage of the data to be preserved, such that a user can specify the percentage of the point-in-time data which is prewritten to the target storage device. Alternatively, the parameter may be, for example, a probability of a collision occurring, such that a user can specify a probability of a collision occurring.

US Patent:

20110280404, Nov 17, 2011

Filed:

May 14, 2010

Appl. No.:

12/780732

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua Marshall Rhoades - Idaho Falls ID, US
Matthew J. Ward - Tucson AZ, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

H04L 9/08
H04L 9/06

US Classification:

380278, 380277

Abstract:

Provided are a method, system, and article of manufacture for iterative data secret-sharing transformation and reconversion. In one aspect, data secret-sharing transformation and reconversion is provided in which each bit of an input stream of bits of data is split, on a bit by bit basis, into a pair of secret-sharing bits, and the secret-sharing bits of each pair of secret-sharing bits are separated into separate streams of secret-sharing bits. In this manner, one secret-sharing bit of each pair of secret-sharing bits may be placed in one stream of secret-sharing bits and the other secret-sharing bit of each pair may be placed in another stream of secret-sharing bits different from the one stream of secret-sharing bits. Confidentiality of the original input stream may be protected in the event one but not both streams of secret-sharing bits is obtained by unauthorized personnel. In another aspect, for an input stream of N bits, each received bit of the N bits of the input stream of data, may be interatively split, on a bit by bit basis, into a pair of secret-sharing bits, to generate as few as N+1 secret-sharing bits from the input stream of bits N bits. Other features and aspects may be realized, depending upon the particular application.

US Patent:

20110289059, Nov 24, 2011

Filed:

May 19, 2010

Appl. No.:

12/783231

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua Marshall Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 17/30

US Classification:

707654, 707640, 707E17007

Abstract:

A data transfer application implemented in a computational device receives a request to copy a plurality of storage volumes that form a consistency group. A determination is made that a first storage volume of the plurality of storage volumes is more likely to be written into than a second storage volume of the plurality of storage volumes, in response to receiving the request to copy the plurality of storage volumes. The first storage volume is copied before copying the second storage volume, in response to determining that the first storage volume is more likely to be written into than the second storage volume.

US Patent:

20120124308, May 17, 2012

Filed:

Nov 17, 2010

Appl. No.:

12/948652

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua M. Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 12/16
G06F 12/00

US Classification:

711162, 711E12001, 711E12103

Abstract:

Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure is generated indicating data blocks in the first storage to copy to the second storage. A drain operation is initiated to copy the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.

US Patent:

20120185433, Jul 19, 2012

Filed:

Jan 14, 2011

Appl. No.:

13/007406

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua M. Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 17/30

US Classification:

707623, 707E17005

Abstract:

A priority-based method for replicating data is disclosed herein. In one embodiment, such a method includes providing a primary storage device and a secondary storage device. Multiple storage areas (e.g., volumes, groups of volumes, etc.) are designated for replication from the primary storage device to the secondary storage device. A priority level is assigned to each of the storage areas. Using these priority levels, the method replicates the storage areas from the primary storage device to the secondary storage device in accordance with their assigned priority levels. Higher priority storage areas are replicated prior to lower priority storage areas. A corresponding computer program product and system are also disclosed herein.

US Patent:

20120254568, Oct 4, 2012

Filed:

May 17, 2012

Appl. No.:

13/474081

Inventors:

Jason L. Peipelman - Vail AZ, US
Joshua M. Rhoades - Idaho Falls ID, US
Matthew J. Ward - Vail AZ, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 12/16

US Classification:

711162, 711E12103

Abstract:

Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure indicates data blocks in the first storage to copy to the second storage. A drain operation copies the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.