Excavating
Patent
1991-08-29
1994-07-26
Canney, Vincent P.
Excavating
371 21, 371 102, G06F 722
Patent
active
053331435
ABSTRACT:
B-Adjacent coding is used to correct up to two DASDs in error in an array of N data DASDs and two redundant DASDs. When two of the data DASDs fail, their data can be recreated as a function of a pair of syndromes constituting up to two Boolean equations in two unknowns. Prestoring of the matrices of the powers of the polynomial terms of the code primitive together with pipeline processing operate to expedite data recovery and balance the write operations load on the DASDs across the array. Recovery from the failure of a data and a redundant DASD involves resolving one linear Boolean equation with one unknown.
REFERENCES:
patent: 3745538 (1978-07-01), Patel
patent: 4092732 (1978-05-01), Ouchi
patent: 4775978 (1988-10-01), Hartness
patent: 4914656 (1990-04-01), Dunphy, Jr. et al.
"A Case for Redundant Arrays of Inexpensive Disks (RAID)," D. A. Patterson, et al., UCB/CSD 87/391, Dec. 1987, Computer Science Division, U.C. of Berkeley, pp. 109-116.
"Computer Design", Langdon, Computeach Press, San Jose, Calif., LC 81-71785, pp. 463-505, and Sequential Logic, pp. 506-557.
Watkinson, "Coding for Digital Recording", Focal Press of Butterworth Scientific, 1990, pp. 119-130.
Blaum Miguel M.
Ouchi Norman K.
Brodie R. Bruce
Canney Vincent P.
International Business Machines - Corporation
LandOfFree
Method and means for b-adjacent coding and rebuilding data from does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and means for b-adjacent coding and rebuilding data from , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and means for b-adjacent coding and rebuilding data from will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1056528