Kevin L Kidney

US Patent:

7805633, Sep 28, 2010

Filed:

Sep 18, 2006

Appl. No.:

11/522777

Inventors:

Satish Sangapu - Wichita KS, US
Kevin Kidney - Lafayette CO, US
William Hetrick - Wichita KS, US

Assignee:

LSI Corporation - Milpitas CA

International Classification:

G06F 11/00

US Classification:

714 7, 714 6

Abstract:

The present invention is a system for optimizing the reconstruction and copyback of data contained on a failed disk in a multi-disk mass storage system. A system in accordance with the present invention may comprise the following: a processing unit requiring mass-storage; one or more disks configured as a RAID system; an associated global hot spare disk; and interconnections linking the processing unit, the RAID and the global hot spare disk. In a further aspect of the present invention, a method for the reconstruction and copyback of a disconnected RAID disk utilizing a global hot spare disk is disclosed. The method includes: disconnecting a RAID component disk; reconstructing data from the disconnected RAID disk onto a global hot spare disk; reconnecting the disconnected RAID component disk; and copying the reconstructed data from the global hot spare disk back to the reconnected RAID component disk.

US Patent:

8176390, May 8, 2012

Filed:

Apr 16, 2009

Appl. No.:

12/424559

Inventors:

Kevin Lee Kidney - Lafayette CO, US

Assignee:

LSI Corporation - Milpitas CA

International Classification:

G06F 11/00

US Classification:

714770, 714765

Abstract:

Several methods and apparatus to single XOR operation weaver reconstruction of a failed drive of a raid are disclosed. A failed drive of the drive group implemented in a WEAVER code with an (n,t,t) layout is determined. A set of scatter/gather lists is produced from a number of the other drives of the drive group. A scatter/gather list is created by modifying a pointer data of the set of scatter/gather lists. An additional scatter/gather list is generated from the set of scatter/gather lists. A single XOR operation is performed on the data segment, the parity segment, the additional data segment and the additional parity segment to form a resulting scatter/gather list including a resulting data segment and a resulting parity segment. The resulting data segment and the resulting parity segment are written as sequenced in the resulting scatter/gather list to a replacement drive.

US Patent:

8176405, May 8, 2012

Filed:

Oct 6, 2008

Appl. No.:

12/246195

Inventors:

James Lee Hafner - San Jose CA, US
Wendy Ann Belluomini - San Jose CA, US
Douglas William Dewey - Tucson AZ, US
Brian D. McKean - Longmont CO, US
Donald R. Humlicek - Wichita KS, US
Kevin L. Kidney - Lafayette CO, US
Theresa L. Segura - Broomfield CO, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H03M 13/00

US Classification:

714807, 714769, 711114

Abstract:

A method for validating data in a data storage system comprising associating a first data chunk with first check data and storing the first data chunk and the first check data on a first storage device. Additional associated data chunks of the first data and associated additional check data are stored on at least one of the first storage device or one or more additional storage devices. At least a portion of the first check data and at least a portion of the additional check data are stored to a second storage device, which is distinct from the first storage device and the additional storage devices. I/O access to the second storage device is minimized by retaining at least a portion of the first check data and at least a portion of the additional check data in a readily accessible storage medium, during servicing of a first I/O request.

US Patent:

8201001, Jun 12, 2012

Filed:

Aug 4, 2009

Appl. No.:

12/462425

Inventors:

Brian McKean - Longmont CO, US
Kevin Kidney - Lafayette CO, US
Ross Zwisler - Lafayette CO, US

Assignee:

LSI Corporation - Milpitas CA

International Classification:

G06F 1/32

US Classification:

713320, 713300, 713310

Abstract:

The present invention is a method for drive management and data placement in an archival storage system having a set of drives. The method includes mapping redundant data stripes onto the drives. A first active data stripe, located on a first subset of the drives, is then selected from the mapped data stripes. The first subset is placed into a normal power state and a second subset of the drives is placed into a low power state. Data is then written to the first active data stripe. Before the first active data stripe is fully used, the method includes selecting a next active/second active data stripe from the mapped data stripes, the second active data stripe being at least partially located on the second subset. The method may be performed by a system which implements MAID techniques for drive management and CRUSH for data placement.

US Patent:

8276041, Sep 25, 2012

Filed:

Nov 12, 2008

Appl. No.:

12/269123

Inventors:

James Lee Hafner - San Jose CA, US
Wendy Ann Belluomini - San Jose CA, US
Douglas William Dewey - Tuscson AZ, US
Brian D. McKean - Longmont CO, US
Donald R. Humlicek - Wichita KS, US
Kevin L. Kidney - Lafayette CO, US
Theresa L. Segura - Broomfield CO, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G11C 29/00

US Classification:

714763, 714718, 714722

Abstract:

A method for reading data from a data storage system is provided. The method comprises requesting a virtual data volume to access data from one or more data blocks in the data storage system; requesting a virtual protection information volume to access protection information associated with the data blocks; validating the data using the protection information; and providing the data to the host interface, in response to successful validation of the data. A method for writing data to a data storage system is also provided. The method comprises receiving data to be written to one or more data blocks in the data storage system, wherein the data is stored in a cache; generating protection information to be stored on a virtual protection information volume; requesting a virtual data volume to update the data blocks with the data; and requesting the virtual protection information volume to store the protection information.

US Patent:

8341457, Dec 25, 2012

Filed:

Mar 11, 2010

Appl. No.:

12/721712

Inventors:

Andrew J. Spry - Wichita KS, US
Kevin Kidney - Lafayette CO, US

Assignee:

LSI Corporation - Milpitas CA

International Classification:

G06F 11/00

US Classification:

714 622, 714 62, 714 621, 714 15

Abstract:

The present disclosure is directed to a system and a method for optimizing redundancy restoration in distributed data layout environments. The system may include a plurality of storage devices configured for providing data storage. The system may include a prioritization module communicatively coupled to the plurality of storage devices. The prioritization module may be configured for determining a restoration order of at least a first data portion and a second data portion when a critical data failure occurs. The system may include a restoration module communicatively coupled to the plurality of storage devices and the prioritization module, the restoration module configured for restoring at least the first data portion and the second data portion based upon the restoration order.

US Patent:

8566673, Oct 22, 2013

Filed:

Aug 4, 2011

Appl. No.:

13/197830

Inventors:

Kevin Kidney - Lafayette CO, US
Kenneth Day - Wichita KS, US

Assignee:

LSI Corporation - San Jose CA

International Classification:

G11C 29/00

US Classification:

714770, 714773, 714766

Abstract:

A method for computing and storing parity information in a RAID system includes dividing each segment in a stripe into a data block and a parity block, and storing in each parity block, parity information for a limited number of other data blocks in the stripe. A method for rebuilding data in a RAID system includes rebuilding the data from parity information and storing the rebuilt data on reserve portions of the remaining disks in the system.

US Patent:

20030037071, Feb 20, 2003

Filed:

Aug 3, 2001

Appl. No.:

09/922430

Inventors:

Kenneth Harris - Lafayette CO, US
Kevin Kidney - Lafayette CO, US
Brian McKean - Longmont CO, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F012/00

US Classification:

707/200000

Abstract:

A method and apparatus for quiescing a system storage device wherein cache lines associated with a system storage device to be quiesced are flushed using a stripe lock mechanism to find and flush cache data associated with the given system storage device. Dirty cache lines are associated with a stripe lock, and that stripe lock will be in the active state or the clearing state. The stripe locks are also maintained on a linked list per a system storage device. In the normal life cycle of a stripe lock, if the partner controller requests a lock over part of the extent of an active lock, the active lock will go to the clearing state. Data in the extent of the now clearing lock is flushed. For performing a quiesce, stripe locks for the given system storage device are set to clearing on a plurality of controllers, thus causing the flush. The quiesce mechanism then only needs to wait until stripe locks have been cleared for the system storage device.