System and method for tolerating multiple storage device...

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

C711SE12002, C711SE12084

Reexamination Certificate

active

07945729

ABSTRACT:
A fault-tolerant system for storage arrays that stored parity values both on separate disks from the data elements (horizontally aligned) and on the same disks as the data elements (vertically aligned), a so-called horizontal-vertical code or HoVer code. The fault-tolerant system has embodiments that are supported on a variety of array sizes and has significant flexibility in parameter selection. Certain embodiments can tolerate all combinations of T failed disks and, among those, some embodiments can tolerate many instances of more than T failures. The fault-tolerant system has efficient XOR-based encoding, recovery, and updating algorithms and has simple redundancy formulas.

REFERENCES:
patent: 4205324 (1980-05-01), Patel
patent: 5271012 (1993-12-01), Blaum et al.
patent: 5459853 (1995-10-01), Best et al.
patent: 5513192 (1996-04-01), Janku et al.
patent: 6101615 (2000-08-01), Lyons
patent: 6158017 (2000-12-01), Han et al.
patent: 6327672 (2001-12-01), Wilner
patent: 6353895 (2002-03-01), Stephenson
patent: 6453428 (2002-09-01), Stephenson
patent: 6502166 (2002-12-01), Cassidy
patent: 6530004 (2003-03-01), King et al.
patent: 6643822 (2003-11-01), Murthy
patent: 6792391 (2004-09-01), Nanda
patent: 6848022 (2005-01-01), Nanda
patent: 2003/0126523 (2003-07-01), Corbett et al.
patent: 2003/0196023 (2003-10-01), Dickson
patent: 2004/0078642 (2004-04-01), Nanda
patent: 2004/0260868 (2004-12-01), Sit et al.
patent: 200410004288.6 (2004-02-01), None
patent: 2000148409 (1998-11-01), None
Charles M. Kozierok; “RAID Level 6”; The PC Guide; Site Version 2.2.0; Apr. 17, 2001.; http://www.pcguide.com/ref/hdd/perf/raid/levels/singleLevel6-c.html.
“RAID-Definitions”; Oct. 23, 2003; p. 4; http://web.archive.org/web/20031023132300/http://linux.cudeso.be/raid.php#raid6.
Paul Massiglia; “The RAID book: A Storage System Technology Handbook”; 1997; pp. 139-140.
Paul Massiglia; “The RAID book: A Storage System Technology Handbook”; 1997; p. 140.
Paul Massiglia, “The RAID Book: A Storage System Technology Handbook”, 6thEdition, Feb. 1997, pp. 137-140.
Guillermo A. Alvarez et al., (“Tolerating Multiple Failures in RAID Architectures with Optimal Storage And Uniform Declustering”), Interntional Symposium On Computer Architecture, 1997, pp. 62-72, http://delivery.acm.org/10.1145/270000/264132/p62-alvarez.pdf?key1=264132&key2=1711781721&coll=GUIDE&dl=GUIDE&CFID=85337343&CFTOKEN=44364468.
S. Mishra et al., “Dual-Crosshatch Disk Array: A highly reliable Hybrid-RAID architecture,” Proceedings of the 24th International Conference on Parallel Processing, 2002.
“I/O Considerations for Database Performance,” An MTI Technology Corporation White Paper, available on Nov. 23, 2004, at: http://66.102.7.104/search?q=cache: YUj7NF0T0a8J:db.ittoolbox.com/browse.asp%3Fc%3DDBPeerPublishing%26r%3D/pub/JB050202.pdf+I/O+Considerations+for+Database+Performance&hl=en&ie=UTF-8.
M. Cohen et al., “Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays,” Sep. 22, 2000.

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

System and method for tolerating multiple storage device... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for tolerating multiple storage device..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for tolerating multiple storage device... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2641197

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