Error detection/correction and fault detection/recovery – Pulse or data error handling – Replacement of memory spare location – portion – or segment
Reexamination Certificate
2007-10-09
2007-10-09
Louis-Jacques, Jacques (Department: 2112)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Replacement of memory spare location, portion, or segment
C714S777000
Reexamination Certificate
active
10619649
ABSTRACT:
Error tolerance is increased for a storage system having a plurality of arrays by making local redundancy in a selected array globally available throughout the storage system. To achieve the increased error tolerance, a donor array is selected from the plurality of arrays when the difference between a minimum Hamming distance of the donor array and a minimum Hamming distance of a recipient array is greater or equal to 2. A donor storage unit is selected in the donor array and recipient information is then rebuilt from the recipient array on the selected storage unit. The selected storage unit is indicated to the donor array as having been donated before the lost information is rebuilt on the selected storage unit. Preferably, the minimum Hamming distance of the recipient array is d≧2 before the donor array is selected from the plurality of arrays.
REFERENCES:
patent: 5134616 (1992-07-01), Barth et al.
patent: 5134619 (1992-07-01), Henson et al.
patent: 5148432 (1992-09-01), Gordon et al.
patent: 5257391 (1993-10-01), DuLac et al.
patent: 5301297 (1994-04-01), Menon et al.
patent: 5398253 (1995-03-01), Gordon
patent: 5506977 (1996-04-01), Jones
patent: 5546535 (1996-08-01), Stallmo et al.
patent: 5579475 (1996-11-01), Blaum et al.
patent: 5611069 (1997-03-01), Matoba
patent: 5617425 (1997-04-01), Anderson
patent: 5787460 (1998-07-01), Yashiro et al.
patent: 5835938 (1998-11-01), Yamamoto et al.
patent: 5835940 (1998-11-01), Yorimitsu et al.
patent: 5848229 (1998-12-01), Morita
patent: 5862158 (1999-01-01), Baylor et al.
patent: 5937428 (1999-08-01), Jantz
patent: 5954822 (1999-09-01), Yashiro et al.
patent: 6070249 (2000-05-01), Lee
patent: 6138125 (2000-10-01), DeMoss
patent: 6154853 (2000-11-01), Kedem
patent: 6161165 (2000-12-01), Solomon et al.
patent: 6212682 (2001-04-01), Kuno
patent: 6269453 (2001-07-01), Krantz
patent: 6275898 (2001-08-01), DeKoning
patent: 6279138 (2001-08-01), Jadav et al.
patent: 6289471 (2001-09-01), Gordon
patent: 6353895 (2002-03-01), Stephenson
patent: 6408400 (2002-06-01), Taketa et al.
patent: 6530004 (2003-03-01), King et al.
patent: 6581135 (2003-06-01), Nakano et al.
patent: 6687791 (2004-02-01), Morrison
patent: 6957313 (2005-10-01), Hsia et al.
patent: 2002/0035667 (2002-03-01), Bruning, III et al.
patent: 0 518 603 (1992-12-01), None
Harris, Selwa; International Search Report from European Patent Office' Application No: PCT/EP2004/051383; pp. 1-10.
G.A. Alvarez et al., Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering, Computer Architecture News (USA), V. 25, #2, pp. 62-72, May 1972.
V. Bohossian et al., Computing in the RAIN: A Reliable Array of Independent Nodes, pp. 1-20, Sep. 24, 1999.
P.M. Chen et al., RAID: High-Performance, Reliable Secondary Storage, ACM Computing Surveys, vol. 26, No. 2, pp. 146-185, Jun. 1994.
M. Holland et al., Parity Declustering for Continuous Operation in Redundant Disk Arrays, ACM 0-89791-535-6/92/0010/0023, pp. 23-35, Oct. 1992.
N.K. Ouchi, Two-Level DASD Failure Recovery Method, IBM Technical Disclosure Bulletin, vol. 36, No. 03, pp. 187-190, Mar. 1993.
D.A. Patterson et al., A Case for Redundant Arrays of Inexpensive Disk (RAID), ACM 0-89791-268-3/88/0006/0109 1998.
J.S. Plank, A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems, pp. 1-19, Feb. 19, 1999.
E.J. Schwabe et al., Evaluating Approximately Balanced Parity-Declustered Data Layouts for Disk Arrays, ACM 0-89791-813-4/96/05, pp. 41-54, 1996.
E.J. Schwabe et al., Flexible Usage of Parity Storage Space in Disk Arrays, ACM 0-89791-809-6/96/06, pp. 99-108, 1996.
L. Xu et al., X-Code: MDS Array Codes with Optimal Encoding, IEEE Trans. On Information Theory, vol. 45, No. 1, pp. 272-276, Jan. 1999.
M. Blaum et al., “MDS Array Codes with Independent Parity Symbols,” IEEE Trans. on Information Theory, Vol. IT-42, pp. 529 542, Mar. 1996.
M. Blaum et al., “The EVENODD Code and its Generalization,” High Performance Mass Storage and Parallel I/O: Technologies and Applications, edited by H. Jin et al., IEEE & Wiley Press, New York, Chapter 14, pp. 187 208, 2001.
M. Blaum et al., “EVENODD: An Efficient Scheme For Tolerating Double Disk Failures In A RAID Architecture,” IEEE Trans. on Computers, vol. 44, No. 2, pp. 192-202, Feb. 1995.
Office Action in EP 04 766 141.8 - 1225 mailed Jul. 12, 2007, 3 pages.
Hetzler Steven Robert
Smith Daniel Felix
Chaudry Mujtaba K.
Curtin, L.L.C. Joseph P.
Louis-Jacques Jacques
LandOfFree
Autonomic parity exchange does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Autonomic parity exchange, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Autonomic parity exchange will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3888273