|Publication number||US7793167 B2|
|Application number||US 11/843,791|
|Publication date||Sep 7, 2010|
|Filing date||Aug 23, 2007|
|Priority date||Aug 23, 2007|
|Also published as||US20090055688|
|Publication number||11843791, 843791, US 7793167 B2, US 7793167B2, US-B2-7793167, US7793167 B2, US7793167B2|
|Inventors||James L. Hafner, Carl E. Jones, David R. Kahler, Robert A. Kubo, David F. Mannenbach, Karl A. Nielsen, James A. O'Conner, Krishnakumar R. Surugucchi|
|Original Assignee||International Business Machines Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (13), Non-Patent Citations (1), Referenced by (4), Classifications (16), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention relates generally to data storage systems, and in particular, to detecting and correcting dropped write errors.
The basic operation of hard disk drives (HDDs) is well known in the art. It is also known that HDDs are complex electromechanical units and, as such, are subject to a wide variety of failure mechanisms. Microscopic defects in the magnetic coding materials used on the platter, contamination of the platter with dust, dirt or magnetic particles and aging can all cause data loss. As with all electronics, random failure can occur from a wide variety of underlying physical processes or small defects associated with manufacturing processes. Moving parts are subject to friction and wear out over time which can also cause HDD assemblies to fail.
The present invention provides a method for detecting and correcting dropped writes in a data storage system. Data, including first data and at least a first checksum associated with the first data, are written to a storage device, such as a RAID array, in a full stride write. The state of the first data is classified as being in a first “new data, unconfirmed” state. The state of written data is periodically checked, such as may be determined by a timer, to determine whether a dropped write event has occurred. If a dropped write event is detected during a periodic check of the first data, its state is changed from the first state to a second “single dropped write confirmed” state. Preferably, the dropped write will then be corrected and the state of the first data changed to a third “confirmed good” state. If no dropped write event is detected, its state is changed from the first state to the third state.
Not all HDD failures manifest themselves as a solid hard failure of the entire hard disk assembly. Some problems are more subtle and can be difficult to detect. For example, it is crucial to be able to precisely locate the magnetic read/write head to the exact position over the platter to ensure that the data is written to or read from the correct location on the platter. Slight variations can result in data being written to or read from the wrong location.
Many techniques have been used and improved over the years to help ensure that HDD failures do not cause data loss or data integrity issues due to more subtle failure modes. Embedded checkers such as error correction codes (ECC) are used on HDDs to detect bad sectors. Cyclic redundancy checks (CRCs) and longitudinal redundancy checks (LRCs) may comprise embedded checkers used by HDD electronics or disk adapter or they may comprise checkers used by higher levels of code and applications to detect HDD errors. CRCs and LRCs are written coincident with data to help detect data errors. CRCs and LRCs are hashing functions used to produce a small and substantially unique bit pattern generated from the data. When the data is read from the HDD, the check sum is regenerated and compared to what is stored on the platter. The signatures must match exactly to ensure the data retrieved from the magnetic pattern encoded on the disk is what was originally written to the disk.
Systems of redundant array of independent disks (RAID) have been developed to improve performance or to increase the availability of disk storage systems or both. RAID distributes data across several independent HDDs. There are many different RAID schemes that have been developed, each having different characteristics and different benefits and disadvantages associated with them. Performance, availability and utilization/efficiency (the percentage of the disk space that actually holds customer data) are perhaps the most important. The tradeoffs associated with various schemes have to be carefully considered because improvements in one attribute can often result in reductions in another.
RAID-5 is a widely used scheme that achieves a good balance between performance, availability and utilization. It uses a single parity field that is the XOR (exclusive-OR) of the data elements across multiple unique HDDs. In the event of a single HDD failure, the data on the remaining HDDs is used with the parity field to reconstruct the data from the failed HDD by XOR-ing the data on the remaining disks together to recreate the data from the failed disk. As with many other RAID schemes, RAID-5 has a performance advantage in that it is not necessary to read the data from all HDDs in a data stripe (full stride write or FSW) in order to recalculate the new parity value for the stripe every time a write occurs. Rather, when writing small amounts of data to update a single data element, a technique known as read-modified-write (RMW) is used whereby the old data from a single HDD is read along with the old parity from another HDD. The old data is XOR-ed with the new data and old parity to produce a new parity which is then written to appropriate disk along with the new data. This may be a considerable performance improvement, especially with wider (larger N−N+P) RAID-5 arrays.
However, because an HDD rebuild can often take several hours to complete, if another disk in the RAID-5 array fails before the first failed HDD is replaced and the data rebuilt on the new disk, all of the data associated with the RAID-5 array will be lost. Thus, RAID-5 can only tolerate a single HDD failure and there is no way to reconstruct the data when two HDDs fail.
RAID-6 is an extension to RAID-5 in which a second independent checksum field is introduced. While RAID-5 can continue to operate in the presence of a single HDD failure, RAID-6 can continue to operate in the presence of two HDD failures. In RAID-6, the second checksum field may be created using Reed-Solomon coding or using simple RAID-5-like XORs where no data element of the XOR is used more than once to generate the check sums.
One HDD failure mode that is particularly troublesome is a dropped write which occurs when a disk controller issues a write command to a HDD and receives a response back from the HDD indicating the write completed successfully. However, the write to the HDD did not actually occur. Although normally rare, there are a variety of failure mechanisms that can cause dropped writes. There may have been a failure in the write pre-amp. A small piece of metal shaving in the drive may have shorted out the write head. Other, subtle or intermittent failure of the write heads can cause a dropped write. A code problem in the HDD assembly may cause it as well.
A situation which is comparable to a dropped write can also occur if the write head is not centered over the correct track or is located entirely over the incorrect track. In the latter case, a subsequent read operation proceeds and the data read from the track looks valid, but is stale. In the former case, in which the write was not centered properly, the drive may generate a bad ECC when it attempts to read the data back from the center of the track. To compensate, the drive then offsets the heads slightly one way or the other to attempt to get good data. If the head is offset one way, it will get the correct data but if it is offset the other way, it will get stale data. As used herein, the term “dropped write” error or event will include both of these conditions as well as the condition described in the immediately previous paragraph.
Unfortunately, embedded checkers such as ECC used on HDDs to detect bad sectors as well as CRCs and LRCs that are used by the disk controller/disk adapter or higher levels of code and applications may prove ineffective in detecting dropped write errors. These checkers cannot always detect a dropped write because the data read from the disk location is not of a bad content. When a request is made to the drive to read the sector, valid data is read from the media but it is not the correct data. Rather, the data is stale; that is, the data that is read is the data that was present before the last write and that was not overwritten by new data when it should have been. Thus, all of the checkers may still be valid for the old data and provide no indication of an error. It will be appreciated that when such incorrect data is retrieved from a drive but the drive does not indicate the presence of an error, RAID reconstruction techniques are not invoked and cannot be used to locate and correct the error.
Dropped writes can be difficult to detect and there is concern that they can potentially cause serious customer data corruption and restoration issues. Every read-modified-write using bad (including stale) data from a dropped write serves to further propagate the data errors to other HDDs in the RAID array causing migration and expansion of the data corruption and making it all the more difficult to determine which HDD originally caused the problem. In fact, in some scenarios, the propagation of an undetected dropped write can modify the RAID checksum in such a way that makes it impossible to detect the condition.
Failure analysis data indicates that dropped writes typically manifest themselves in a single hard drive in an array and may propagate. Consequently, it is important to quickly and accurately identify the drive exhibiting the problem.
As an example of error propagation from a dropped write condition, consider a RAID-5 array with three data disks and one parity disk (3+P) is initially in a good state, with all disks being present and the parity being in sync with the data. The array initially resembles the following (where the ‘+’ sign represents the XOR function):
P = A + B + C
Assume first that the data in A needs to be changed; the new data for A will be indicated as A′. When the new data is written, the parity must also be updated. First, using the read-modified-write process, the old data A on Disk 1 and the old data P on the parity disk are read from the drives. Then the new parity P′ is calculated by XOR'ing the old parity P with the old data A to remove the old data A from the parity and then XOR'ing the result with the new data A′. Thus, the new P′=P+A+A′=A+B+C+A+A′=A+A+A′+B+C. The two As cancel leaving P′=A′+B+C. Finally, the new data A′ and parity P′ are written to the disks:
P′ = A′ + B + C
Next assume that Disk 1 is dropping writes. The array again initially resembles the following:
P = A + B + C
First, the old data A on Disk 1 and the old data P on the parity disk are read from the drives. Then the new parity P′ is calculated. Again, P′=P+A+A′=A+B+C+A′=A+A+A′+B+C=A′+B+C and the new parity is still calculated correctly. Finally, the new data A′ and parity P′ are written to their respective disks. However, this time Disk 1 does not actually perform the write. The disks thus resemble the following:
P′ = A′ + B + C
Note that Disk 1 still contains the old data A, not the new data A′, but the new parity indicates that the data on Disk 1 should be A′. If the data on Disk 1 was rebuilt or reconstructed at this point, the correct data could still be rebuilt from A′=B+C+P′. If, however, the data on Disk 1 is not rebuilt or reconstructed, the array remains in an “Initial Corrupted State.” From this state, the corruption can propagate to the parity in a number of ways, two of which will be described.
First, starting in the initial corrupted state, assume that a new write of A occurs; designated as A″. The data on Disk 1, still the original A, and the data on the parity disk, now P′, are read from the drives. The new parity is calculated as P″=P′+A+A″=A′+B+C+A+A″. Nothing cancels because the data A read from Disk 1 is not the data A′ that was used to generate the parity P′. A″ and P″ are now written to the disks and again, Disk 1 drops the write. The disks now resemble the following:
P″ = A + A′ + A″ + B + C
The parity is corrupted and there is no way to reconstruct correct data A″. If it is now detected that Disk 1 is dropping writes the data is rejected, then the data that will be generated in the rebuild will be P″+B+C=A+A′+A″, clearly invalid data. If the rest of the members of the array, B and C, were read instead of the old A to calculate parity in a full stride write, then the parity would have been correctly calculated. However, this is not done due to its adverse effect on performance. For arrays wider than 3+P, it takes fewer drive operations to perform a read-modified-write as described above.
A second example of the manner in which an error from a dropped write may propagate starts in the initial corrupted state shown above. Assume in this example that we a write is made to both B and C. The new data will be B′ and C′ and since these are recorded with a single write, there is only one update of the parity. In this case, it takes fewer drive operations to read the rest of the array than it does to read only the changing data. So the old data A is read from Disk 1 and there is no need to read the parity P. A new parity P″ is calculated from the data A that was read from Disk 1 and XOR'ing it with the new data B′ and C′ for Disks 2 and 3. The new parity will be P″=A+B′+C′. P″ is incorrect because the data for Disk 1 should have been A′, not A. The disks will now resemble the following:
P″ = A + B′ + C′
Although the parity is now consistent with the data which is actually on the disks, the write of A′ has now been completely lost. It was not part of the generation of the new parity P″ and cannot be recovered.
The present invention may be employed with RAID codes, such as RAID-5, which rely on a single checksum process to detect a dropped write. The present invention may further be employed with multiple checksum RAID codes, such as RAID-6. With such codes, an additional property becomes available that can be used to both detect and correct dropped writes. In general, for minimum distance codes like Reed-Solomon (RS) codes comprised of symbols made up of m-bit sequences, the erasure correction capability (when the data error is pinpointed through some independent means) is determined as:
e+2t≦d min ≦n−k
where dmin is the code minimum distance, n is the total number of code symbols, k is the number of data symbols being encoded and t is the error correction capability (the capability of the code to pinpoint and correct an error). For RAID-6, where there are two checksums:
e+2t≦d min ≦n−k=2
Either two errors may be corrected when the location is pinpointed by an independent means or the RAID-6 code may be used to detect a single error, pinpoint its location and then correct it. The present invention provides method, apparatus and computer program product for taking advantage of this property. Although described in the context of a RAID-6 environment, the correction aspect of the present invention may be employed with any multiple checksum code.
The controller 110 provides a number of functions, any or all of which may be implemented in hardware, software, firmware or in any combination and which will be referred to herein as “modules.” A data write module 112 encodes and formats data before it is written to the array 130. A checksum or parity generator module 114 generates parity or other checksum for a data stripe during a write operation and regenerates parity during a read operation. A RAID control module 116 supervises the writing of a data stripe and parity across the HDDs D0-Di and P0, P1. The controller 110 also includes a data state module 118 and a timer 120 whose functions will be described below. The controller 110 further includes a processor 122 (which may actually comprise multiple processors) and memory 124 (which may comprise one or more of any type of computer readable, volatile or non-volatile medium usable with a programmable computer and having computer-readable code embodied therein). Any of the functions performed by the modules may be executed by the processor from program instructions stored in the memory 124. For clarity, other, commonly used storage components are not shown in
A method of the present invention will be described with reference to the flowcharts of
Next, a determination is made as to whether a check is to be made of the array 130 for a dropped write event (step 210). For example, the timer 120 may be used to periodically determine if a predetermined interval has expired. When the interval has expired, the state of a selected stride of data previously written to the array 130 is checked (step 300). Alternatively, or in addition, selected data may be checked for dropped writes at other times, such as during periods of low system utilization. If the interval has not yet expired, or if the system is not in a period of low utilization, the process jumps to step 220 to determine if a write request is pending.
One method for detecting a dropped write error, a “parity scrub,” is illustrated in the flowchart of
After the check for a dropped write has been performed (step 300), a determination is made as to whether a dropped write event has been detected (step 212). If so, the selected data is classified by the data state module 118 as being in a “single dropped write detected state” (step 214). When the present invention is implemented with a multi-checksum code, the dropped write is preferably corrected (step 216). For example, if the data on disk D1 is stale, the data on the other disks are read and XOR'ed with the parity symbols on the parity disks P0, P1. The resulting data will be the correct data which is then written to disk D1. If the correction is successful, or if no dropped write is detected at step 212, the selected data is then re-classified by the data state module 118 as being in the “confirmed good data” state (step 218). A determination is then made as to whether a write request is pending (step 220). If not, the process returns back to step 210 to determine if a check should be made for a dropped write.
If, on the other hand, a write request is pending at step 220, the data is received from the host (step 222). A determination is made as to whether, because the data is extensive enough, a full stride write is to be performed over existing data (step 224). If so, FSW checksums are generated (step 204) whereupon the process described above continues.
If an FSW is not to be performed, the data is to be written to the array 130 in a read modified write operation. A determination is made as to whether the data to be overwritten was previously classified by the data state module 118 as being in a “confirmed good data” state (step 226). If so, a flag or other indicator is put into a first state, such as by setting a bit to a ‘1’ (step 228); otherwise, the flag is put into a second state, such as by setting the bit to a ‘0’ (step 230). The parity module 114 then generates RMW checksum symbols (step 232), the data and checksums are written to the array 130 in an RMW process (step 234). The data is then classified by the data state module 118 as being in an “unquantifiable” state (step 236), indicating that a dropped write error may no longer be reliably detected or corrected and may thereby propagate errors through the data.
The flag that was set in steps 228 or 230 is checked (step 238). If the flag indicates that the data received from the host had not been previously classified as being in the “confirmed good data” state, a determination is made as to whether there is a pending write request (step 220). If so, the process returns to step 222 to receive the data from the host. If at step 238 it is determined that the flag indicates that the data was classified as being in the “confirmed good data” state, the data is reclassified by the data state module 118 as being in the “new, unconfirmed” state (step 208) and the process continues.
The present invention ensures acceptable performance by reducing how often a check is made for dropped write errors, thereby significantly reducing any adverse impact on performance. For example, it is possible to execute one check without impacting performance. However, if several checks are made in a row, a serious performance problem may be created. The present invention includes a mechanism to limit the frequency with which attempts to detect dropped write errors are made; in the illustrated embodiment, the limiting mechanism may be the timer 120. More specifically, but by way of example and not limitation, assume that about 20 ms are required to read a 32K block of data from a single HDD in the array 130. Assume further that the array 130 consists of 10 HDDs. It would, therefore, take about 200 ms to perform a parity scrub (that is, to read an entire stride, regenerate the checksums and compare the original checksums with the regenerated checksums). One-fifth of a second would add up to a significant amount of time if the parity scrub was performed frequently. However, if the present invention is implemented and the predetermined interval of the timer 120 is set so that a parity scrub is performed only once each minute, a relatively small and insignificant 1/300 of a minute is needed.
In addition to implementing the present invention in storage systems in actual use in customer facilities, the present invention may also be used as a stress test as part of a quality control process following the manufacture of HDDs. For example, the HDDs may be rigorously exercised and then the process of the present invention be enabled in such a manner as to prevent the HDDs from being placed in the “unquantifiable state.” HDDs which exhibit a tendency to produce dropped writes could thus be weeded out and not placed into service. In a similar fashion, the process of the present invention may be used by service technicians as a field stress exerciser on unused areas of a customer's HDDs. Intermittent and previously undiagnosable errors caused by dropped writes may thus be identified.
It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions and a variety of forms and that the present invention applies regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include recordable-type media such as a floppy disk, a hard disk drive, a RAM, and CD-ROMs and transmission-type media such as digital and analog communication links.
The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated. Moreover, although described above with respect to methods and systems, the need in the art may also be met with a computer program product containing instructions for detecting and correcting dropped writes in a data storage system.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4319356 *||Dec 19, 1979||Mar 9, 1982||Ncr Corporation||Self-correcting memory system|
|US4733396 *||Dec 4, 1986||Mar 22, 1988||Kabushiki Kaisha Toshiba||Apparatus for detecting and correcting data transfer errors of a magnetic disk system|
|US5233618 *||Mar 2, 1990||Aug 3, 1993||Micro Technology, Inc.||Data correcting applicable to redundant arrays of independent disks|
|US5278839 *||Apr 16, 1991||Jan 11, 1994||Hitachi, Ltd.||Semiconductor integrated circuit having self-check and self-repair capabilities|
|US6212208 *||Nov 7, 1997||Apr 3, 2001||Matsushita Electric Industrial Co., Ltd.||Method for coding and multiplexing multimedia data, apparatus for coding and multiplexing multimedia data, record media containing program for coding and multiplexing multimedia data|
|US20030145270||Jan 31, 2002||Jul 31, 2003||Holt Keith W.||Method for using CRC as metadata to protect against drive anomaly errors in a storage array|
|US20040123032||Dec 24, 2002||Jun 24, 2004||Talagala Nisha D.||Method for storing integrity metadata in redundant data layouts|
|US20050216063 *||Mar 23, 2004||Sep 29, 2005||Cardiac Pacemakers, Inc.||System and method for recovery from memory errors in a medical device|
|US20050251628||May 10, 2004||Nov 10, 2005||Jarvis Thomas C||Method, system, and program for demoting tracks from cache|
|US20060075287||Oct 6, 2004||Apr 6, 2006||Vageline Michael P||Detecting data integrity|
|US20060109792||Nov 23, 2004||May 25, 2006||Broadbent Steven T||Apparatus and method to check data integrity when handling data|
|US20060179381||Feb 7, 2005||Aug 10, 2006||Durica William J||Detection and recovery of dropped writes in storage devices|
|US20060242459||Apr 19, 2006||Oct 26, 2006||Hyde Joseph S Ii||Method, apparatus and program storage device for protecting data writes in a data storage device|
|1||U.S. Appl. No. 11/843,804, filed Aug. 23, 2007, entitled "Detection and Correction of Dropped Write Errors in a Data Storage System".|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8166370 *||May 23, 2007||Apr 24, 2012||Marvell International Ltd.||Efficient RAID ECC controller for RAID systems|
|US8347182 *||Jun 23, 2009||Jan 1, 2013||International Business Machines Corporation||Ensuring data consistency|
|US9075745||Feb 26, 2013||Jul 7, 2015||Marvell International Ltd.||System and method for adding a drive to a storage system having multiple drives|
|US20100005374 *||Jan 7, 2010||International Business Machines Corporation||Ensuring Data Consistency|
|U.S. Classification||714/54, 370/248, 714/805, 714/42|
|Cooperative Classification||G11B2220/2516, G06F11/004, G06F2211/104, G06F2211/109, G11B20/1833, G06F11/1076, G11B2220/415, G11B2020/1843|
|European Classification||G06F11/10R, G06F11/10M, G06F11/00H|
|Aug 23, 2007||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES (IBM) CORPORATION,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HAFNER, JAMES L.;JONES, CARL F.;KAHLER, DAVID R.;AND OTHERS;REEL/FRAME:019737/0388;SIGNING DATES FROM 20070731 TO 20070817
Owner name: INTERNATIONAL BUSINESS MACHINES (IBM) CORPORATION,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HAFNER, JAMES L.;JONES, CARL F.;KAHLER, DAVID R.;AND OTHERS;SIGNING DATES FROM 20070731 TO 20070817;REEL/FRAME:019737/0388
|Apr 18, 2014||REMI||Maintenance fee reminder mailed|
|Jul 11, 2014||FPAY||Fee payment|
Year of fee payment: 4
|Jul 11, 2014||SULP||Surcharge for late payment|