Elizabeth Katherine Richards

US Patent:

7552152, Jun 23, 2009

Filed:

Mar 5, 2007

Appl. No.:

11/681971

Inventors:

Elizabeth S. Richards - Columbia MD, US
Sandeep M. Uttamchandani - San Jose CA, US
Li Yin - Redmond WA, US

Assignee:

International Business Machines Corporation - Armonk NY
The United States of America as represented by the National Security Agency - Washington DC

International Classification:

G06F 12/00

US Classification:

707204, 707200, 707202, 707203, 707205, 711162

Abstract:

The embodiments of the invention provide a method, computer program product, etc. for risk-modulated proactive data migration for maximizing utility. More specifically, a method of planning data migration for maximizing utility of a storage infrastructure that is running and actively serving at least one application includes selecting a plurality of potential data items for migration and selecting a plurality of potential migration destinations to which the potential data items can be moved. Moreover, the method selects a plurality of potential migration speeds at which the potential data items can be moved and selects a plurality of potential migration times at which the potential data items can be moved to the potential data migration destinations. The selecting of the plurality of potential migration speeds selects a migration speed below a threshold speed, wherein the threshold speed defines a maximum system utility loss permitted.

US Patent:

7752239, Jul 6, 2010

Filed:

Apr 3, 2008

Appl. No.:

12/061764

Inventors:

Elizabeth S. Richards - Columbia MD, US
Sandeep M. Uttamchandani - San Jose CA, US
Li Yin - Albany CA, US

Assignee:

International Business Machines Corporation - Armonk NY
The United States of America as represented by National Security Agency - Washington DC

International Classification:

G06F 7/00

US Classification:

707812, 707674, 707679, 707640

Abstract:

The embodiments of the invention provide a method, computer program product, etc. for risk-modulated proactive data migration for maximizing utility. More specifically, a method of planning data migration for maximizing utility of a storage infrastructure that is running and actively serving at least one application includes selecting a plurality of potential data items for migration and selecting a plurality of potential migration destinations to which the potential data items can be moved. Moreover, the method selects a plurality of potential migration speeds at which the potential data items can be moved and selects a plurality of potential migration times at which the potential data items can be moved to the potential data migration destinations. The selecting of the plurality of potential migration speeds selects a migration speed below a threshold speed, wherein the threshold speed defines a maximum system utility loss permitted.

US Patent:

7958093, Jun 7, 2011

Filed:

Sep 17, 2004

Appl. No.:

10/944597

Inventors:

Kay Schwendimann Anderson - Washington DC, US
Frederick Douglis - Basking Ridge NJ, US
Nagui Halim - Yorktown Heights NY, US
John Davis Palmer - San Jose CA, US
Elizabeth Suzanne Richards - Columbia MD, US
David Tao - Glen Burnie MD, US
William Harold Tetzlaff - Emeryville CA, US
John Michael Tracey - Scarsdale NY, US
Joel Leonard Wolf - Katonah NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/00

US Classification:

707662, 707610, 707640, 707661, 707667, 707672, 707673, 707674, 707687, 707758, 707781, 707812, 707822, 709203, 709204, 709205, 709206, 711100, 719311, 719315, 719316

Abstract:

A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.

US Patent:

20060075007, Apr 6, 2006

Filed:

Sep 17, 2004

Appl. No.:

10/943397

Inventors:

Kay Anderson - Washington DC, US
Frederick Douglis - Basking Ridge NJ, US
Nagui Halim - Yorktown Heights NY, US
John Palmer - San Jose CA, US
Elizabeth Richards - Columbia MD, US
David Tao - Glen Burnie MD, US
William Tetzlaff - Emeryville CA, US
John Tracey - Scarsdale NY, US
Joel Wolf - Katonah NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 12/00

US Classification:

707206000, 711159000

Abstract:

A system and method for optimizing a storage system to support full utilization of storage space are provided. With the system and method, data objects/containers of data objects are assigned retention values when they are created. These retention values may be dynamically modified based on a modification function associated with the data objects/containers. When storage space needs to be freed for the storage of new data objects/containers, the retention values of existing data objects/containers provide a prioritization as to which data objects/containers should be deleted from the storage system and the order by which these data objects/containers are to be deleted to make available storage space for the new data objects/containers. The identification of the data objects/containers that are to be deleted may be based on a dynamically modified delete threshold, a sorted list of retention values, or the like.