WO2001054127A9 - Apparatus and method for reconstructing missing data using cross-parity stripes on storage media - Google Patents
Apparatus and method for reconstructing missing data using cross-parity stripes on storage mediaInfo
- Publication number
- WO2001054127A9 WO2001054127A9 PCT/US2001/002301 US0102301W WO0154127A9 WO 2001054127 A9 WO2001054127 A9 WO 2001054127A9 US 0102301 W US0102301 W US 0102301W WO 0154127 A9 WO0154127 A9 WO 0154127A9
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- parity
- stripes
- symbols
- stripe
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
- G11B20/1833—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2211/00—Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
- G06F2211/10—Indexing scheme relating to G06F11/10
- G06F2211/1002—Indexing scheme relating to G06F11/1076
- G06F2211/108—RAIT, i.e. RAID on tape drive
Definitions
- the present invention is directed to an apparatus and method for reconstructing 'missing data using cross-parity stripes on storage media. Specifically, the invention is directed to the use of a plurality of cross-parity stripes on storage media to correct for errors in reading the data on the storage media.
- parity stripes to correct up to three read errors on magnetic tape is generally known in the art.
- U.S. Patent No. 4,201,976 issued to Arvind M. Patel, and the article by the same author entitled "Adaptive cross- parity (AXP) Code for a High-Density Magnetic Tape Subsystem," IBM J. Res. Develop., vol. 29, no. 6, November 1985, describe a method for using vertical and cross parity stripes to correct data bits on a single magnetic tape for up to three stripe read errors.
- AXP Adaptive cross- parity
- RAIT redundant array of independent tape
- the present invention provides an apparatus and method for reconstructing missing data using cross-parity stripes on a storage medium.
- the apparatus and method may operate on data symbols having sizes greater than a data bit, such as may be used in a RAIT system.
- the apparatus and method makes use of a plurality of parity stripes for reconstructing missing data stripes.
- the parity symbol values in the parity stripes are used as a basis for determining the value of the missing data symbol in a data stripe .
- a correction matrix is shifted along the data stripes, correcting missing data symbols as it is shifted.
- the correction is performed from the outer most data stripes towards the inner data stripes to thereby use previously reconstructed data symbols to reconstruct other missing data symbols .
- data is reconstructed by organizing the received parity stripes in order.
- the smallest slope diagonal lines of the correction matrix representing the linear equations of the parity symbols, may be used to correct the top and bottom most missing data stripes as deep as is necessary.
- the next largest slope lines may be used to correct the next inner missing data stripe and so forth until all the missing data stripes are corrected.
- Figure 1 is an exemplary diagram of a virtual magnetic tape volume for illustrating the present invention
- Figure 2 is an exemplary diagram illustrating the use of a correction matrix and parity stripes to correct missing data stripes
- Figure 3 is an exemplary diagram illustrating the virtual magnetic tape volume of Figure 2 at a later time in the data stripe correction process
- Figure 4 is an exemplary diagram of a hardware implementation for generating the parity stripes
- Figure 5 is an exemplary block diagram of a data reconstruction apparatus according to the present invention.
- Figure 6 is a flowchart outlining an exemplary operation of the data reconstruction apparatus of Figure 5.
- Figure 1 is an exemplary diagram of a virtual tape volume 100 of a RAIT system.
- the virtual tape volume 100 of Figure 1 may be distributed over a plurality of physical tape drives.
- the tape volume includes a preface section 110, a data stripe section 120, a suffix section 130 and a plurality of data stripes 140.
- the present invention will be described with reference to the use of magnetic tape medium and a virtual tape volume, it should be understood by those of ordinary skill in the art that the invention is not limited to such an exemplary embodiment. Rather, the invention is applicable to any storage medium that may make use of parity information for reconstruction of missing data.
- the invention may be implemented with magnetic disks, optical disks, magnetic tape, holographic storage medium, and the like. For purposes of explanation, however, the invention will be described with reference to magnetic tape medium and a RAIT system.
- a symbol length s may be defined in terms of bits of data, bytes of data or any data word length.
- the symbol length s is assumed to be 32 bits, although any length symbol, such as 8, 16, 32 or 64 bits, may be used without departing from the spirit and scope of the present invention.
- a plurality of parity stripes designated by the identifiers p x , are created and the resulting n+p stripes are distributed over the physical tape drives.
- the parity symbols of a parity stripe are independent linear equations of the data symbols which may be corrected using the parity symbol.
- the parity symbol 151 may be used to correct an error in reading any of the data symbols along line 152.
- Line 152 corresponds to the linear equation of parity symbol 151.
- the parity stripes are thus, identified by the slope of the linear equation of the parity symbols in the parity stripe.
- the slope of the linear equation may be identified as rise: run. If the slope is considered to be -l:x, the x value may be used to designate the slope of the linear equation of a parity stripe.
- the slope of line 152 is - 1:2, and hence, the parity stripe for the parity symbol 151 is designated p 2 .
- the parity stripe for parity symbol 153 is p ⁇ . (the slope of line 154 is -1:1) .
- the parity stripes p x are created with the assumption that there is a sufficiently large preface 110 of zero value symbols before the data stripe 120 and a sufficiently large suffix 130 of zero value symbols after the data stripe.
- the size of the preface 110 and the suffix 130 may be, for example, equal to the number of data stripes times the number of parity stripes.
- the size of the preface 110 and the suffix 130 for 8 data stripes and 5 parity stripes may be 40 symbols in length.
- the preface 110 and suffix 130 may not actually have zero value symbols in the data stripes 140 but may be assumed to have zero values for purposes of reconstructing data lost due to stripe read errors.
- the preface 110 is used to provide a known starting point of correct data.
- parity symbols that do not contain any information from data stripes do not need to be stored.
- parity stripes for po are 2 symbols long
- parity stripes for -p ⁇ are 1+n symbols long
- p 2 parity stripes are 2+2r ⁇ symbols long, and so on.
- the length of parity stripe p 2 is 2+16 symbols.
- burst erasure channel When a stripe read error occurs during the reading of data from a virtual tape volume, such as that shown in Figure 1, data is lost and must be reconstructed. For example, when a stripe read error occurs, an entire burst, i.e. an entire data stripe, is zeroed out. This is known as burst erasure channel .
- data is reconstructed by organizing the received parity stripes in order.
- the smallest slope diagonal lines (largest abs (x) ) , representing the linear equations of the parity symbols, may be used to correct the top and bottom most missing data stripes as deep as is necessary.
- the next largest slope lines (abs(x)-l) may be used to correct the next inner missing data stripe and so forth until all the missing stripes are corrected.
- Figures 2 and 3 illustrate how the parity stripes may be used to correct missing data stripes.
- Figure 2 shows an initial starting position for the reconstruction of missing data stripes.
- the black dots represent missing data symbols
- the white dots represent known zeroes
- the gray dots represent known data symbols.
- the data symbols of data stripes 0, 1, 2, 5 and 7 have been burst erased due to a stripe read error in reading the data from the virtual tape volume. With prior art devices, such an error would make the entire stripe group unreadable.
- the present invention may reconstruct the missing data by using, for example, 5 parity stripes having the correction matrix 210. The reconstruction is performed from the outside in.
- the symbol in data stripe 0 is corrected by parity stripe p -2
- the symbol in data stripe 1 is corrected by parity stripe p_ ⁇
- the symbol in data stripe 7 is then corrected by parity stripe p 2
- the symbol in data stripe 5 is corrected by parity stripe pi
- the symbol in data stripe 2 is corrected by parity stripe
- Figure 3 shows the correction matrix 210 at a later point in time in the data reconstruction process. As shown in Figure 3, all of the data symbols for the missing data stripes which are within the correction matrix 210 have been corrected. The remaining missing data symbols of the missing data stripes to the right of the correction matrix 210 will be corrected as the correction matrix 210 is shifted to the right through the data stripe section 120 and into the suffix 130.
- the reconstruction may be thought of as a system of two equations having one unknown variable.
- the symbols along line 310 in Figure 3 for example, have the following values 0, 2, 4, 10, 15, 20, 24 and that data symbol 315 must be reconstructed. Since we know the value of the linear equation represented by the line 310, i.e. the parity symbol value, we can solve the system of equations for the unknown variable. Thus, for example, if the value of the parity symbol is 85, the system of equations becomes:
- equation (2) the system of equations may be solved for X which gives a value of 10. Therefore, the value of the missing data symbol is 10. Accordingly, the data symbol for data stripe 5 may be reconstructed to have the value 10.
- the values of the data symbols are 32 bit data values and the "+" symbols in the above equation are exclusive OR operations.
- the underlying concept described above is still applicable.
- Figure 4 is an exemplary diagram of a hardware configuration for parity stripe generation according to the present invention.
- the hardware configuration includes a plurality of parity accumulation buffers 410-450 and a plurality of associated XOR units 455- 475.
- a parity accumulation buffer and an XOR unit is provided for each parity stripe and is dedicated to the respective parity stripe.
- each parity accumulation buffer 410-450 As data is read in by the data input device 480, an offset into each parity accumulation buffer 410-450 is set. As the data is clocked in, the XOR units 455-475 process the data s bits at a time. The resulting parity symbol value for the respective parity stripes is then output to the parity stripe write device 490 for writing the parity stripes on the magnetic tape medium.
- FIG. 5 is an exemplary block diagram of a data reconstruction apparatus 500 according to the present invention.
- the data reconstruction apparatus includes a controller 510, an input interface 520, a memory 530, a data reconstruction unit 540, and an output interface 550. These devices are in communication with one another by way of control/signal bus 560.
- a bus architecture is shown in Figure 5, it should be appreciated that any other type of architecture that facilitates communication among the elements 510-550 may be used without departing from the spirit and scope of the invention.
- the data is supplied to the data reconstruction apparatus 500 via the input interface 520 and is temporarily stored in the memory 530.
- the controller 510 monitors the data input via the input interface 520 to determine if any of the data from the magnetic tape is missing or otherwise unreadable. If any of the data is determined to be missing, the controller 510 instructs the data reconstruction unit 540 to reconstruct the missing data using the data stored in memory 530. The reconstructed data is then output via the output interface 550 for use by a data processing system.
- FIG. 6 is a flowchart outlining an exemplary operation of the data reconstruction apparatus 500.
- the operation starts with the controller receiving data input from a magnetic tape reader (step 610) .
- the controller 510 monitors the input data to determine if there is any missing data (step 620) . If not, the controller 510 continues to monitor the input data for missing data. If there is missing data, the controller 510 instructs the data reconstruction unit 540 to reconstruct the missing data using the method described above (step 630) .
- the reconstructed data is then output for use by a data processing apparatus (step 640) .
- the operation may then be repeated until an end condition, such as a termination of the reading of the magnetic tape, is encountered (step 650) .
- the present invention has been described with reference to the use of 5 parity stripes and 8 data stripes, the invention is not limited to such an implementation. Rather, the invention facilitates the use of any number of parity stripes and data stripes. With an increase in parity stripes, the number of lines in the correction matrix 210 should be increased with each line having a different slope.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2001237964A AU2001237964A1 (en) | 2000-01-24 | 2001-01-23 | Apparatus and method for reconstructing missing data using cross-parity stripes on storage media |
EP01910347A EP1254455A1 (en) | 2000-01-24 | 2001-01-23 | Apparatus and method for reconstructing missing data using cross-parity stripes on storage media |
JP2001554341A JP2003521085A (en) | 2000-01-24 | 2001-01-23 | Apparatus and method for reconstructing lost data due to horizontal parity stripes on storage media |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/490,258 US6581185B1 (en) | 2000-01-24 | 2000-01-24 | Apparatus and method for reconstructing data using cross-parity stripes on storage media |
US09/490,258 | 2000-01-24 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2001054127A1 WO2001054127A1 (en) | 2001-07-26 |
WO2001054127A9 true WO2001054127A9 (en) | 2002-10-24 |
Family
ID=23947288
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2001/002301 WO2001054127A1 (en) | 2000-01-24 | 2001-01-23 | Apparatus and method for reconstructing missing data using cross-parity stripes on storage media |
Country Status (5)
Country | Link |
---|---|
US (1) | US6581185B1 (en) |
EP (1) | EP1254455A1 (en) |
JP (1) | JP2003521085A (en) |
AU (1) | AU2001237964A1 (en) |
WO (1) | WO2001054127A1 (en) |
Families Citing this family (54)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7346831B1 (en) | 2001-11-13 | 2008-03-18 | Network Appliance, Inc. | Parity assignment technique for parity declustering in a parity array of a storage system |
US6851082B1 (en) | 2001-11-13 | 2005-02-01 | Network Appliance, Inc. | Concentrated parity technique for handling double failures and enabling storage of more than one parity block per stripe on a storage device of a storage array |
US8402346B2 (en) * | 2001-12-28 | 2013-03-19 | Netapp, Inc. | N-way parity technique for enabling recovery from up to N storage device failures |
US6993701B2 (en) * | 2001-12-28 | 2006-01-31 | Network Appliance, Inc. | Row-diagonal parity technique for enabling efficient recovery from double failures in a storage array |
US7613984B2 (en) * | 2001-12-28 | 2009-11-03 | Netapp, Inc. | System and method for symmetric triple parity for failing storage devices |
US7640484B2 (en) | 2001-12-28 | 2009-12-29 | Netapp, Inc. | Triple parity technique for enabling efficient recovery from triple failures in a storage array |
US7073115B2 (en) * | 2001-12-28 | 2006-07-04 | Network Appliance, Inc. | Correcting multiple block data loss in a storage array using a combination of a single diagonal parity group and multiple row parity groups |
US7080278B1 (en) | 2002-03-08 | 2006-07-18 | Network Appliance, Inc. | Technique for correcting multiple storage device failures in a storage array |
US7539991B2 (en) | 2002-03-21 | 2009-05-26 | Netapp, Inc. | Method and apparatus for decomposing I/O tasks in a raid system |
US7437727B2 (en) * | 2002-03-21 | 2008-10-14 | Network Appliance, Inc. | Method and apparatus for runtime resource deadlock avoidance in a raid system |
US7200715B2 (en) | 2002-03-21 | 2007-04-03 | Network Appliance, Inc. | Method for writing contiguous arrays of stripes in a RAID storage system using mapped block writes |
US7254813B2 (en) * | 2002-03-21 | 2007-08-07 | Network Appliance, Inc. | Method and apparatus for resource allocation in a raid system |
US6976146B1 (en) | 2002-05-21 | 2005-12-13 | Network Appliance, Inc. | System and method for emulating block appended checksums on storage devices by sector stealing |
US7155634B1 (en) * | 2002-10-25 | 2006-12-26 | Storage Technology Corporation | Process for generating and reconstructing variable number of parity for byte streams independent of host block size |
US7185144B2 (en) | 2003-11-24 | 2007-02-27 | Network Appliance, Inc. | Semi-static distribution technique |
US7664913B2 (en) * | 2003-03-21 | 2010-02-16 | Netapp, Inc. | Query-based spares management technique |
US7424637B1 (en) | 2003-03-21 | 2008-09-09 | Networks Appliance, Inc. | Technique for managing addition of disks to a volume of a storage system |
US7328364B1 (en) | 2003-03-21 | 2008-02-05 | Network Appliance, Inc. | Technique for coherent suspension of I/O operations in a RAID subsystem |
US7111147B1 (en) * | 2003-03-21 | 2006-09-19 | Network Appliance, Inc. | Location-independent RAID group virtual block management |
US7143235B1 (en) | 2003-03-21 | 2006-11-28 | Network Appliance, Inc. | Proposed configuration management behaviors in a raid subsystem |
US7275179B1 (en) | 2003-04-24 | 2007-09-25 | Network Appliance, Inc. | System and method for reducing unrecoverable media errors in a disk subsystem |
US20070033430A1 (en) * | 2003-05-05 | 2007-02-08 | Gene Itkis | Data storage distribution and retrieval |
US7827362B2 (en) | 2004-08-24 | 2010-11-02 | Symantec Corporation | Systems, apparatus, and methods for processing I/O requests |
US7904428B2 (en) | 2003-09-23 | 2011-03-08 | Symantec Corporation | Methods and apparatus for recording write requests directed to a data store |
US7287133B2 (en) | 2004-08-24 | 2007-10-23 | Symantec Operating Corporation | Systems and methods for providing a modification history for a location within a data store |
US7577806B2 (en) | 2003-09-23 | 2009-08-18 | Symantec Operating Corporation | Systems and methods for time dependent data storage and recovery |
US7725760B2 (en) | 2003-09-23 | 2010-05-25 | Symantec Operating Corporation | Data storage system |
US7991748B2 (en) | 2003-09-23 | 2011-08-02 | Symantec Corporation | Virtual data store creation and use |
US7730222B2 (en) | 2004-08-24 | 2010-06-01 | Symantec Operating System | Processing storage-related I/O requests using binary tree data structures |
US7328305B2 (en) * | 2003-11-03 | 2008-02-05 | Network Appliance, Inc. | Dynamic parity distribution technique |
US7263629B2 (en) * | 2003-11-24 | 2007-08-28 | Network Appliance, Inc. | Uniform and symmetric double failure correcting technique for protecting against two disk failures in a disk array |
US7366837B2 (en) * | 2003-11-24 | 2008-04-29 | Network Appliance, Inc. | Data placement technique for striping data containers across volumes of a storage system cluster |
US7647451B1 (en) | 2003-11-24 | 2010-01-12 | Netapp, Inc. | Data placement technique for striping data containers across volumes of a storage system cluster |
US20060075281A1 (en) * | 2004-09-27 | 2006-04-06 | Kimmel Jeffrey S | Use of application-level context information to detect corrupted data in a storage system |
US7398460B1 (en) | 2005-01-31 | 2008-07-08 | Network Appliance, Inc. | Technique for efficiently organizing and distributing parity blocks among storage devices of a storage array |
JP4799027B2 (en) * | 2005-03-31 | 2011-10-19 | 富士通株式会社 | Memory control circuit and address error check method in memory control circuit |
US9384818B2 (en) | 2005-04-21 | 2016-07-05 | Violin Memory | Memory power management |
US8200887B2 (en) | 2007-03-29 | 2012-06-12 | Violin Memory, Inc. | Memory management system and method |
US8560503B1 (en) | 2006-01-26 | 2013-10-15 | Netapp, Inc. | Content addressable storage system |
US7822921B2 (en) | 2006-10-31 | 2010-10-26 | Netapp, Inc. | System and method for optimizing write operations in storage systems |
US7613947B1 (en) | 2006-11-30 | 2009-11-03 | Netapp, Inc. | System and method for storage takeover |
US7647526B1 (en) | 2006-12-06 | 2010-01-12 | Netapp, Inc. | Reducing reconstruct input/output operations in storage systems |
US9632870B2 (en) * | 2007-03-29 | 2017-04-25 | Violin Memory, Inc. | Memory system with multiple striping of raid groups and method for performing the same |
US11010076B2 (en) | 2007-03-29 | 2021-05-18 | Violin Systems Llc | Memory system with multiple striping of raid groups and method for performing the same |
US8209587B1 (en) | 2007-04-12 | 2012-06-26 | Netapp, Inc. | System and method for eliminating zeroing of disk drives in RAID arrays |
US7840837B2 (en) * | 2007-04-27 | 2010-11-23 | Netapp, Inc. | System and method for protecting memory during system initialization |
US8898536B2 (en) * | 2007-04-27 | 2014-11-25 | Netapp, Inc. | Multi-core engine for detecting bit errors |
US7836331B1 (en) | 2007-05-15 | 2010-11-16 | Netapp, Inc. | System and method for protecting the contents of memory during error conditions |
US7975102B1 (en) | 2007-08-06 | 2011-07-05 | Netapp, Inc. | Technique to avoid cascaded hot spotting |
US9158579B1 (en) | 2008-11-10 | 2015-10-13 | Netapp, Inc. | System having operation queues corresponding to operation execution time |
US8495417B2 (en) * | 2009-01-09 | 2013-07-23 | Netapp, Inc. | System and method for redundancy-protected aggregates |
WO2010144587A2 (en) | 2009-06-12 | 2010-12-16 | Violin Memory, Inc. | Memory system having persistent garbage collection |
US10929226B1 (en) | 2017-11-21 | 2021-02-23 | Pure Storage, Inc. | Providing for increased flexibility for large scale parity |
JP2021117772A (en) | 2020-01-27 | 2021-08-10 | 富士通株式会社 | Storage system, management device, and data management program |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4201976A (en) | 1977-12-23 | 1980-05-06 | International Business Machines Corporation | Plural channel error correcting methods and means using adaptive reallocation of redundant channels among groups of channels |
US5579475A (en) | 1991-02-11 | 1996-11-26 | International Business Machines Corporation | Method and means for encoding and rebuilding the data contents of up to two unavailable DASDS in a DASD array using simple non-recursive diagonal and row parity |
EP0519669A3 (en) * | 1991-06-21 | 1994-07-06 | Ibm | Encoding and rebuilding data for a dasd array |
US5537567A (en) | 1994-03-14 | 1996-07-16 | International Business Machines Corporation | Parity block configuration in an array of storage devices |
US5623595A (en) | 1994-09-26 | 1997-04-22 | Oracle Corporation | Method and apparatus for transparent, real time reconstruction of corrupted data in a redundant array data storage system |
US5812753A (en) * | 1995-10-13 | 1998-09-22 | Eccs, Inc. | Method for initializing or reconstructing data consistency within an array of storage elements |
US5862158A (en) * | 1995-11-08 | 1999-01-19 | International Business Machines Corporation | Efficient method for providing fault tolerance against double device failures in multiple device systems |
US5884098A (en) * | 1996-04-18 | 1999-03-16 | Emc Corporation | RAID controller system utilizing front end and back end caching systems including communication path connecting two caching systems and synchronizing allocation of blocks in caching systems |
US5805788A (en) * | 1996-05-20 | 1998-09-08 | Cray Research, Inc. | Raid-5 parity generation and data reconstruction |
US6088330A (en) | 1997-09-09 | 2000-07-11 | Bruck; Joshua | Reliable array of distributed computing nodes |
US6092215A (en) * | 1997-09-29 | 2000-07-18 | International Business Machines Corporation | System and method for reconstructing data in a storage array system |
JP3616487B2 (en) * | 1997-11-21 | 2005-02-02 | アルプス電気株式会社 | Disk array device |
US6138201A (en) * | 1998-04-15 | 2000-10-24 | Sony Corporation | Redundant array of inexpensive tape drives using data compression and data allocation ratios |
-
2000
- 2000-01-24 US US09/490,258 patent/US6581185B1/en not_active Expired - Lifetime
-
2001
- 2001-01-23 EP EP01910347A patent/EP1254455A1/en not_active Withdrawn
- 2001-01-23 AU AU2001237964A patent/AU2001237964A1/en not_active Abandoned
- 2001-01-23 JP JP2001554341A patent/JP2003521085A/en active Pending
- 2001-01-23 WO PCT/US2001/002301 patent/WO2001054127A1/en not_active Application Discontinuation
Also Published As
Publication number | Publication date |
---|---|
US6581185B1 (en) | 2003-06-17 |
WO2001054127A1 (en) | 2001-07-26 |
AU2001237964A1 (en) | 2001-07-31 |
JP2003521085A (en) | 2003-07-08 |
EP1254455A1 (en) | 2002-11-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6581185B1 (en) | Apparatus and method for reconstructing data using cross-parity stripes on storage media | |
US7543110B2 (en) | Raid controller disk write mask | |
US7350101B1 (en) | Simultaneous writing and reconstruction of a redundant array of independent limited performance storage devices | |
US6003151A (en) | Error correction and detection system for mass storage controller | |
KR100517482B1 (en) | Concurrent row/column syndrome generator for a product code | |
KR100613056B1 (en) | On-drive integrated sector format raid error correction code system and method | |
US6367047B1 (en) | Multi-level error detection and correction technique for data storage recording device | |
US20050086429A1 (en) | Method, apparatus and program for migrating between striped storage and parity striped storage | |
IE920104A1 (en) | On-the-fly error correction with embedded digital controller | |
US6041431A (en) | Method and apparatus for performing error correction code operations | |
GB2525733A (en) | Error correction with on-demand parity sectors in magnetic data storage devices | |
US5737344A (en) | Digital data storage with increased robustness against data loss | |
US7234024B1 (en) | Application-assisted recovery from data corruption in parity RAID storage using successive re-reads | |
US4796110A (en) | System and method for encoding and storing digital information on magnetic tape | |
WO2002014997A2 (en) | Apparatus and method for writing and reading data to and from a virtual volume of redundant storage devices | |
GB2414592A (en) | Decreasing failed disk reconstruction time in a RAID data storage system | |
US20080195808A1 (en) | Data migration systems and methods for independent storage device expansion and adaptation | |
US5862313A (en) | Raid system using I/O buffer segment to temporary store striped and parity data and connecting all disk drives via a single time multiplexed network | |
US5717535A (en) | Block address integrity check for storage medium | |
US20050086567A1 (en) | Method and apparatus to improve magnetic disc drive reliability using excess un-utilized capacity | |
US5734815A (en) | Method and apparatus for efficient cyclical redundancy check (CRC) maintenance for sub-sector writes | |
US6769088B1 (en) | Sector-coding technique for reduced read-after-write operations | |
US6587977B1 (en) | o,k,m,/m recording code | |
US7131052B2 (en) | Algebraic decoder and method for correcting an arbitrary mixture of burst and random errors | |
KR100539261B1 (en) | Digital Data Coding and Recording Device for DVD and Method thereof |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2001910347 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref country code: JP Ref document number: 2001 554341 Kind code of ref document: A Format of ref document f/p: F |
|
AK | Designated states |
Kind code of ref document: C2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: C2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
COP | Corrected version of pamphlet |
Free format text: PAGES 1/6-6/6, DRAWINGS, REPLACED BY NEW PAGES 1/6-6/6; DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE |
|
WWP | Wipo information: published in national office |
Ref document number: 2001910347 Country of ref document: EP |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWW | Wipo information: withdrawn in national office |
Ref document number: 2001910347 Country of ref document: EP |