Data file migration from a mirrored RAID to a non-mirrored...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S161000, C711S162000, C711S100000, C711S111000, C711S112000, C714S005110, C714S006130, C719S325000, C707S793000, C709S201000, C709S202000, C709S203000

Reexamination Certificate

active

06985995

ABSTRACT:
A data storage methodology wherein a data file is initially stored in a format consistent with RAID-1 and RAID-X and then migrated to a format consistent with RAID-X and inconsistent with RAID-1 when the data file grows in size beyond a certain threshold. Here, RAID-X refers to any non-mirrored storage scheme employing XOR-based error correction coding (e.g., a RAID-5 configuration). Each component object (including the data objects and the parity object) for the data file is configured to be stored in a different stripe unit per object-based secure disk. Each stripe unit may store, for example, 64 KB of data. So long as the data file does not grow beyond the size threshold of a stripe unit (e.g., 64 KB), the parity stripe unit contains a mirrored copy of the data stored in one of the data stripe units because of the exclusive-ORing of the input data with “all zeros” assumed to be contained in empty or partially-filled stripe units. When the file grows beyond the size threshold, the parity stripe unit starts storing parity information instead of a mirrored copy of the file data. Thus, the data file can be automatically migrated from a format consistent with RAID-1 and RAID-X to a format consistent with RAID-X and inconsistent with RAID-1 without the necessity to duplicate or rewrite the stored data.

REFERENCES:
patent: 5392244 (1995-02-01), Jacobson et al.
patent: 5572661 (1996-11-01), Jacobson
patent: 5574851 (1996-11-01), Rathunde
patent: 5659704 (1997-08-01), Burkes et al.
patent: 5881311 (1999-03-01), Woods
patent: 5937174 (1999-08-01), Weber
patent: 5946686 (1999-08-01), Schmuck et al.
patent: 5956734 (1999-09-01), Schmuck et al.
patent: 5960169 (1999-09-01), Styczinski
patent: 5960446 (1999-09-01), Schmuck et al.
patent: 5974503 (1999-10-01), Venkatesh et al.
patent: 5987477 (1999-11-01), Schmuck et al.
patent: 6023706 (2000-02-01), Schmuck et al.
patent: 6052759 (2000-04-01), Stallmo et al.
patent: 6138125 (2000-10-01), DeMoss
patent: 6275898 (2001-08-01), DeKoning
patent: 6298401 (2001-10-01), Anderson
patent: 6405284 (2002-06-01), Bridge
patent: 6513093 (2003-01-01), Chen et al.
patent: 6691209 (2004-02-01), O'Connell
patent: 6795895 (2004-09-01), Merkey et al.
patent: 6862609 (2005-03-01), Merkey
patent: 2002/0194427 (2002-12-01), Hashemi
patent: 2003/0120723 (2003-06-01), Bright et al.
Winn L. Rosch—Hardware Bible (Third Edition)□□Sams Publishing□□pp. 994-1001.
Article by Garth A. Gibson et al. entitled “A Cost-Effective, High-Bandwidth Storage Architecture”, pp. 92-103.
Article by Garth A. Gibson and Rodney Van Meter entitled “Network Attached Storage Architecture”, pp. 37-45, Communications of the ACM, Nov. 2000, vol. 43, No. 11.
Article by Andreas Dilger & Peter J. Braam entitled “Object Based Storage HOWTO”, pp. 1-13, Version 2, Dec. 23, 1999, available at http://www.lustre.org/docs.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Data file migration from a mirrored RAID to a non-mirrored... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Data file migration from a mirrored RAID to a non-mirrored..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data file migration from a mirrored RAID to a non-mirrored... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3585069

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.