James Lloyd Jackson
Professional Counselors at Brodie Grv Apt K 308, Colorado Springs, CO

5933592, Aug 3, 1999

Oct 13, 1995

8/542933

Clark E. Lubbers - Colorado Springs CO
Stephen J. Sicola - Monument CO
Ronald H. McLean - Elbert CO
James Perry Jackson - Colorado Springs CO
Robert A. Ellis - Woodland Park CO

Digital Equipment Corporation - Maynard MA

G06F 1100, G06F 1212

39518204

A RAID array includes redundant storage devices. Data is distributed across the storage devices, and organized as slivers of RAID protected data blocks. This redundancy provides for the reconstruction of valid data when data at a particular data block of a sliver is found to be inconsistent. However, when more than one data block of a sliver is found to have inconsistent data, reconstruction of the inconsistent data blocks may not be possible. Nonetheless, data consistency can still be restored to that sliver. Consistency is restored to such a sliver by replacing any inconsistent data in a data block with predetermined data and reconstructing the parity data block using the predetermined data. Other data in the RAID array keeps track of those data blocks with the predetermined data to indicate that such blocks do not contain valid data.

6161192, Dec 12, 2000

Oct 13, 1995

8/542827

Clark E. Lubbers - Colorado Springs CO
Stephen J. Sicola - Monument CO
Ronald H. McLean - Elbert CO
James Perry Jackson - Colorado Springs CO
Robert A. Ellis - Woodland Park CO

Compaq Computer Corporation - Maynard MA

G06F 1116

714 6

Metadata described herein on a RAID array includes both device metadata and RAIDset metadata. The device metadata has a device FE bit on each storage device corresponding to each RAID protected block on the storage device. The device FE bit indicates if a corresponding RAID protected block is consistent and thereby useable to regenerate data in another RAID protected block in the corresponding RAID protected block's sliver. The user data also has a forced error bit to indicate if a physical block in the user block has inconsistent data, the RAIDset FE bit. The RAID array of storage devices has user data blocks on each storage device RAID protected by being distributed as slivers of blocks across the RAID array of storage devices. Each sliver has a plurality of user data blocks and one parity block. The RAIDset metadata has the RAIDset FE bit corresponding to each RAID protected user data block in the RAID array.

6253289, Jun 26, 2001

May 29, 1998

9/087034

Kenneth Hoffman Bates - Colorado Springs CO
Susan Gaye Elkington - Colorado Springs CO
James Perry Jackson - Colorado Springs CO
Clark Edward Lubbers - Colorado Springs CO
John Franklin Mertz - Colorado Springs CO
Bradford Scott Morgan - Colorado Springs CO

Compaq Computer Corporation - Houston TX

G06F 1200

711137

In a data storage system a number of records are prefetched from large volume storage devices for transfer to a cache in order to return requested records to a host computer in response to a read request from the host computer. If a previous prefetch is not complete when the read request is received, the number of records in a next prefetch of records is increased by a preset amount. If a previous prefetch is complete, a next prefetch of records is initiated with the same number of records in the prefetch as the previous prefetch. The initiation of prefetch operations is triggered by detection of a sequential read stream in a plurality of read requests from the host computer. When the prefetch size is increased, the preset amount of the increase equals the number of records in the read request from the host computer. After requested records are returned from the cache to the host computer in response to the read request, storage space in the cache used by the returned requested records is released.

2007020, Sep 6, 2007

Mar 6, 2006

11/369240

James Reuter - Colorado Springs CO, US
James Jackson - Colorado Springs CO, US
Douglas Voigt - Boise ID, US
Alistair Veitch - Mountain View CA, US

G06F 17/30

707206000

Various embodiments of the present invention provide methods, in distributed data-storage systems that associate one or more timestamps with each data block in each data-storage-component, for deciding whether or not a data block has been written. In certain embodiments of the present invention, a sparse database of timestamps associated with data blocks is maintained, each timestamp having a field that contains one of an indication of a time or sequence and a sentinel value indicating that the timestamp is garbage collected. When a timestamp is not found associated with a data block in a timestamp database, the data block is associated with a garbage-collected-timestamp state. In various embodiments of the present invention, data structures are maintained that store status information indicating whether or not any of a number of data blocks in each of a number of data-block-allocation units have been written. During replication, migration, or reconfiguration of a current segment of data blocks to a new segment of data blocks in these various embodiments, a data block is determined to be written or to be unwritten by determining, from the data structures, whether or not a data block-allocation unit containing the data block is written or unwritten.

7743276, Jun 22, 2010

Sep 27, 2006

11/527875

Michael B. Jacobson - Boise ID, US
James P. Jackson - Colorado Springs CO, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 11/00

714 7, 714 6

Embodiments of the present invention are directed to methods, and distributed data-storage systems employing the methods, for recovering redundancy within a distributed data-storage system upon failure of one or more mass-storage devices within a component data-storage system of the distributed data-storage system. In certain embodiments, failure of a mass-storage device within a component data-storage system elicits a redundancy-recovery operation in which segments affected by the mass-storage-device failure or failures are moved, by a process referred to as “migration,” to other component data-storage systems of the distributed data-storage system, and are recovered as a by-product of migration. Certain embodiments of the present invention more efficiently address redundancy recovery by moving only as many segments from the component data-storage system as needed to provide sufficient free space within the component data-storage system to recover the remaining segments affected by the mass-storage-device failure or failures within the component data-storage system.

5826001, Oct 20, 1998

Oct 13, 1995

8/542670

Clark E. Lubbers - Colorado Springs CO
Stephen J. Sicola - Monument CO
Ronald H. McLean - Elbert CO
James Perry Jackson - Colorado Springs CO
Robert A. Ellis - Woodland Park CO

Digital Equipment Corporation - Maynard MA

G06F 1100, G06F 1110, G06F 1120

39518204

A data block in a RAID array is reconstructed under the control of metadata recorded on the RAID array. The RAID array has a plurality of members, each member being a data storage device. The metadata includes device metadata for data blocks recorded on each member and RAIDset metadata for RAID protected data blocks recorded across the members of the RAID array. The RAID protected data blocks include user data blocks, RAIDset metadata blocks and parity data blocks. The data blocks are reconstructed by detecting from a device FE bit in the device metadata that a bad data block corresponding to or associated with the device FE bit needs to be reconstructed. The data is read from each data block, other than the bad data block, in the same RAID sliver with bad data block. A RAID sliver of data blocks includes all the data blocks in a RAID protected sliver of data blocks. From the data read from the other data blocks in the RAID sliver with the bad data block, the bad data block is regenerated to produce a new data block.

7644308, Jan 5, 2010

Mar 6, 2006

11/369681

Douglas L. Voigt - Boise ID, US
James P. Jackson - Colorado Springs CO, US
Alistair Veitch - Mountain View CA, US
James M. Reuter - Colorado Springs CO, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 11/00

714 20, 714 47, 714 49, 707202, 709207

Embodiments of the present invention are directed to digitally encoded hierarchical timestamps that are stored in computer readable mediums. The hierarchical timestamps of the present invention include a first field that stores a timestamp value and a second field that stores a processing-level indication that indicates the scope of the timestamp within a hierarchical processing system.

7761663, Jul 20, 2010

Feb 16, 2006

11/357776

Svend Frolund - Aalborg, DK
Arif Merchant - Palo Alto CA, US
Alistair Veitch - Palo Alto CA, US
James M. Reuter - Colorado Springs CO, US
James Perry Jackson - Colorado Springs CO, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06F 12/00

711119, 711114, 711162, 714 6, 709201

A unit of data is read from memory of a replicated cache. The replicated cache comprises a plurality of independent computing devices. Each independent computing device comprises a processor and a portion of the memory. Confirmations are received from at least a majority of the independent computing devices that a flush operation for the unit of data was initiated no later than a time indicated by the timestamp and that a more recent version of the unit of data has not been flushed. The unit of data is provided to storage.