Laura A Richardson

US Patent:

8341312, Dec 25, 2012

Filed:

Apr 29, 2011

Appl. No.:

13/097510

Inventors:

Gabriel Alatorre - Long Beach CA, US
Aameek Singh - University Place WA, US
Laura Richardson - Ridge Manor FL, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/50
G06F 9/45
G06F 3/00
G06F 13/28
G06F 13/00

US Classification:

710 33, 703 13, 703 22, 710 5, 710 15, 710 29

Abstract:

Managing a data transfer from one or more source storage devices to one or more target storage devices. The data transfer comprises concurrent transfer of a multiplicity of data units pursuant to respective data transfer commands. The concurrent transfer of the multiplicity of data units is currently in-progress. A computer determines a currently-overloaded storage component involved in the data transfer. The computer determines a plurality of the data transfer commands that involve the overloaded storage component. The computer determines an approximately-minimum number of the data transfer commands to cancel to stop overload of the overloaded storage component. In response, the computer cancels the minimum number of the data transfer commands.

US Patent:

8386418, Feb 26, 2013

Filed:

Nov 30, 2009

Appl. No.:

12/627755

Inventors:

John G. Birch - Nokesville VA, US
Laura A. Richardson - Ridge Manor FL, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30
G06F 7/00

US Classification:

707602, 707802

Abstract:

A method and system relate to data storage, and more particularly, to an intelligent storage service catalog. A method is implemented in a computer infrastructure having programming instructions. The programming instructions are operable to receive at least one definition of storage requirements for an organization for at least one data type and establish at least one data storage allocation rule based on the at least one data type. Additionally, the programming instructions are operable to receive a request for storage for the at least one data type and allocate data storage based on the request for storage and the at least one data storage allocation rule.

US Patent:

8495260, Jul 23, 2013

Filed:

Sep 12, 2012

Appl. No.:

13/612088

Inventors:

Gabriel Alatorre - Long Beach CA, US
Laura Richardson - Ridge Manor FL, US
Aameek Singh - University Place WA, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/50
G06F 9/45
G06F 3/00
G06F 13/28
G06F 13/00

US Classification:

710 33, 703 13, 703 22, 710 5, 710 15, 710 29

Abstract:

Managing a data transfer from one or more source storage devices to one or more target storage devices. The data transfer comprises concurrent transfer of a multiplicity of data units pursuant to respective data transfer commands. The concurrent transfer of the multiplicity of data units is currently in-progress. A computer determines a currently-overloaded storage component involved in the data transfer. The computer determines a plurality of the data transfer commands that involve the overloaded storage component. The computer determines an approximately-minimum number of the data transfer commands to cancel to stop overload of the overloaded storage component. In response, the computer cancels the minimum number of the data transfer commands.

US Patent:

20120278512, Nov 1, 2012

Filed:

Apr 29, 2011

Appl. No.:

13/097555

Inventors:

Gabriel Alatorre - Long Beach CA, US
Laura Richardson - Ridge Manor FL, US
Aameek Singh - University Place WA, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 13/14

US Classification:

710 33

Abstract:

Scheduling a proposed additional data transfer from one or more source storage devices to one or more target storage devices. A computer receives a request for the proposed additional data transfer, and in response, determines a measure of the proposed additional data transfer. The computer determines a measure of recent actual data transfers. The recent actual data transfers involve one or more of the source storage devices and one or more of the target storage devices. In response to the request for the proposed additional data transfer, the computer estimates performance of one or more of the source storage devices and one or more of the target storage devices that would occur during the proposed additional data transfer based on the measure of recent actual data transfers combined with the measure of the proposed additional data transfer. The computer compares the estimated performance to a corresponding performance threshold, and if less, the computer postpones execution of the proposed additional data transfer.

US Patent:

20190339876, Nov 7, 2019

Filed:

May 3, 2018

Appl. No.:

15/969902

Inventors:

- Armonk NY, US
Laura Richardson - Tampa FL, US
Dave Aime Desire Kodjo - Sainte-Marthe-Sur-Le-Lac, CA
Lisa M. Chavez - Placitas NM, US

International Classification:

G06F 3/06

Abstract:

A method, computer system, and computer program product for determining whether data compression should be performed at a storage virtualization layer or a backend layer, within a storage area network, including assessing a volume of data to decide whether the volume of data should be compressed or is already compressed, and in response to deciding that the volume of data should be compressed: checking whether a restriction exists on the volume of data, and in response to deciding that the volume of data is already compressed: determining that the volume of data already compressed should be uncompressed based on at least one metric.

US Patent:

20190205032, Jul 4, 2019

Filed:

Mar 8, 2019

Appl. No.:

16/296987

Inventors:

- Armonk NY, US
Per LUTKEMEYER - Lystrup, DK
Laura RICHARDSON - Tampa FL, US
David SCHUSTEK - Parker CO, US

International Classification:

G06F 3/06
H03M 7/30
H03M 7/16
H03M 13/03

Abstract:

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: examining information of first through Nth storage volumes and based on the examining providing for each storage volume of the first through Nth storage volumes a predicted storage space savings value, the predicted storage space savings value indicating a predicted terabyte volume of storage space savings producible by performance of data compression of data stored on the storage volume; predicting a per terabyte compression cost savings associated with compressing one or more storage volume of the first through Nth storage volumes, and providing a ranking of storage volumes of the first through Nth storage volumes based on the examining and the predicting; and scheduling a compression of storage volumes of the first through Nth storage volumes based on the ranking of storage volumes of the first through Nth storage volumes.

US Patent:

20180307441, Oct 25, 2018

Filed:

Apr 25, 2017

Appl. No.:

15/496033

Inventors:

- Armonk NY, US
Per LUTKEMEYER - Lystrup, DK
Laura RICHARDSON - Tampa FL, US
David SCHUSTEK - Parker CO, US

International Classification:

G06F 3/06

Abstract:

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: examining information of first through Nth storage volumes and based on the examining providing for each storage volume of the first through Nth storage volumes a predicted storage space savings value, the predicted storage space savings value indicating a predicted terabyte volume of storage space savings producible by performance of data compression of data stored on the storage volume; predicting a per terabyte compression cost savings associated with compressing one or more storage volume of the first through Nth storage volumes, and providing a ranking of storage volumes of the first through Nth storage volumes based on the examining and the predicting; and scheduling a compression of storage volumes of the first through Nth storage volumes based on the ranking of storage volumes of the first through Nth storage volumes.

US Patent:

20180307442, Oct 25, 2018

Filed:

Dec 17, 2017

Appl. No.:

15/844561

Inventors:

- Armonk NY, US
Per LUTKEMEYER - Lystrup, DK
Laura RICHARDSON - Tampa FL, US
David SCHUSTEK - Parker CO, US

International Classification:

G06F 3/06

Abstract:

Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: examining information of first through Nth storage volumes and based on the examining providing for each storage volume of the first through Nth storage volumes a predicted storage space savings value, the predicted storage space savings value indicating a predicted terabyte volume of storage space savings producible by performance of data compression of data stored on the storage volume; predicting a per terabyte compression cost savings associated with compressing one or more storage volume of the first through Nth storage volumes, and providing a ranking of storage volumes of the first through Nth storage volumes based on the examining and the predicting; and scheduling a compression of storage volumes of the first through Nth storage volumes based on the ranking of storage volumes of the first through Nth storage volumes.