Stephen J. Sicola - Monument CO Susan G. Elkington - Colorado Springs CO Michael D. Walker - Colorado Springs CO Paul Guttormson - Colorado Springs CO Richard F. Lary - Colorado Springs CO
Assignee:
Hewlett-Packard Development Company, L. P. - Houston TX
International Classification:
G06F 1100
US Classification:
714 6, 711162
Abstract:
A data replication system having a redundant configuration including dual Fibre Channel fabric links interconnecting each of the components of two data storage sites, wherein each site comprises a host computer and associated data storage array, with redundant array controllers and adapters. Each array controller in the system is capable of performing all of the data replication functions, and each host âseesâ remote data as if it were local. Each array controller has a dedicated link via a fabric to a partner on the remote side of the long-distance link between fabric elements. Each dedicated link does not appear to any host as an available link to them for data access; however, it is visible to the partner array controllers involved in data replication operations. These links are managed by each partner array controller as if being âclusteredâ with a reliable data link between them.
Method For Transaction Command Ordering In A Remote Data Replication System
Stephen J. Sicola - Monument CO Susan G. Elkington - Colorado Springs CO Michael D. Walker - Colorado Springs CO Richard F. Lary - Colorado Springs CO
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 1208
US Classification:
711162, 711161, 707204
Abstract:
A disaster-tolerant data backup and remote copy system which is implemented as a controller-based replication of one or more LUNs (logical units) between two remotely separated pairs of array controllers connected by redundant links. The system provides a method for allowing a large number of commands to be âoutstandingâ in transit between local and remote sites while ensuring the proper ordering of commands on remote media during asynchronous or synchronous data replication. In addition, the system provides a mechanism for automatic âtuningâ of links based on the distance between the array controllers.
Distributed Fine-Grained Enhancements For Distributed Table Driven I/O Mapping
James M. Reuter - Colorado Springs CO David W. Thiel - Colorado Springs CO Richard F. Lary - Colorado Springs CO
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 1210
US Classification:
714 5, 711112, 711203, 711205
Abstract:
The present invention provides a virtual storage system that generally stores uses larger segmentations, but divides large segments into smaller sub-segments during data movement operations. The present invention provides a method and system having this hierarchy of segment sizes, namely a large segment for the normal case, while breaking the large segment into single disk blocks during data movement. The mapping has large segments except for those segments undergoing data movement. For those segments, it would be desirable to have the smallest segment size possible, namely, a single disk block. In this way, the administration costs are generally low, but latencies caused by the movement of large data blocks are avoided.
Unified Management System And Method For Multi-Cabinet Data Storage Complexes
Stephen J. Sicola - Palmer Lake CO, US Bruce Sardeson - Colorado Springs CO, US Dennis Spicher - Monument CO, US Bruce Roberts - Colorado Springs CO, US Bill Pagano - Colorado Springs CO, US Richard Lary - Colorado Springs CO, US William K. Miller - Colorado Springs CO, US Mark J. Conrad - Colorado Springs CO, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
A multi-cabinet mass storage system with unified management features. The system includes a first reporting group and a second reporting group each having enclosure with processors, such as an environmental monitoring units (EMUs), for generating and transmitting environmental messages pertaining to the particular enclosures. The enclosures are positioned on shelves within cabinets. A bus or cabinet cable links each enclosure to facilitate broadcasting the environmental messages. The environmental messages identify the sending device's reporting group and its physical location within the system. Additional enclosures are included in this reporting group with enclosures of each reporting group located all in one cabinet, in two or more cabinets, and each cabinet may house one, two, or more reporting groups. A network links all of the cabinets to concurrently broadcast the environmental messages throughout the system and allows enclosures in a single reporting group to be positioned in differing cabinets.
Method For Transaction Command Ordering In A Remote Data Replication System
Stephen J. Sicola - Monument CO, US Susan G. Elkington - Colorado Springs CO, US Michael D. Walker - Colorado Springs CO, US Richard F. Lary - Colorado Springs CO, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 12/00
US Classification:
711162, 711161, 707204
Abstract:
A disaster-tolerant data backup and remote copy system which is implemented as a controller-based replication of one or more LUNs (logical units) between two remotely separated pairs of array controllers connected by redundant links. The system provides a method for allowing a large number of commands to be ‘outstanding’ in transit between local and remote sites while ensuring the proper ordering of commands on remote media during asynchronous or synchronous data replication. In addition, the system provides a mechanism for automatic ‘tuning’ of links based on the distance between the array controllers.
Apparatus And Method For Providing Very Large Virtual Storage Volumes Using Redundant Arrays Of Disks
Randal S. Marks - Colorado Springs CO, US Julia A. Hodges - Colorado Springs CO, US Gerald L. Golden - Colorado Springs CO, US Ryan J. Johnson - Colorado Springs CO, US Bert Martens - Monument CO, US Karen E. Workman - Elbert CO, US Susan G. Elkington - Colorado Springs CO, US Richard F. Lary - Colorado Springs CO, US Jesse Yandell - Colorado Springs CO, US Stephen Sicola - Monument CO, US Roger Oakey - Colorado Springs CO, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 12/00
US Classification:
711114, 711112, 711113, 714 6, 714 7
Abstract:
A very large virtual storage volume formed by distributing disks in multiple, multi-disk RAID (redundant array of independent disks) sets across busses of a back-end controller. The multiple RAID sets are striped by a front-end controller connected to the back-end controller and presented to a host computer as a very large virtual storage volume.
Apparatus And Method For Providing Very Large Virtual Storage Volumes Using Redundant Arrays Of Disks
Randal S. Marks - Colorado Springs CO, US Julia A. Hodges - Colorado Springs CO, US Gerald L. Golden - Colorado Springs CO, US Ryan J. Johnson - Colorado Springs CO, US Bert Martens - Monument CO, US Karen E. Workman - Elbert CO, US Susan G. Elkington - Colorado Springs CO, US Richard F. Lary - Colorado Springs CO, US Jesse Yandell - Colorado Springs CO, US Stephen Sicola - Monument CO, US Roger Oakey - Colorado Springs CO, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 12/00
US Classification:
711114, 711112, 711113, 714 6, 714 7, 714100
Abstract:
A very large virtual volume (e. g. , in excess of 500 GB) is formed by distributing the disks in eleven, six-disk RAID-5 sets across the six busses of a primary local back-end controller. A spare disk is provided on each of the six busses. Each RAID-5 set is protected from the failure of a single disk by the spare disks on the busses, which can use the parity data stored in a RAID-5 set to rebuild the data stored on a failing disk and thereby restore redundancy to the RAID-5 set. Each RAID-5 set is also protected from the failure of a bus by the parity inherent in RAID-5. The RAID-5 sets are striped by a front-end controller connected to the primary local back-end controller, and the striped RAID-5 sets are presented to a host computer as a very large virtual volume. If the individual disks are 9. 1 GB in size, the size of the very large virtual volume can reach 500. 5 GB.
Dual Parity Raid Wherein No More Than N+1 Data Symbols Contribute To Any Parity Symbol
An efficient RAID-6 double parity erasure code scheme. Efficiency is provided by the addition of a single term to a diagonal parity equation. For example, in a five-wide layout (having five physical storage devices) the RAID-6 “parity diagonals” end up with six terms, which are the actual diagonal plus one more data block. As a result, no one data symbol contributes to the erasure code determined from the data symbols, such that no more than n+1 data symbols contribute to any one parity symbol.
Richard Lary 1983 graduate of Montgomery High School in Montgomery, LA is on Classmates.com. See pictures, plan your class reunion and get caught up with ...