Source: http://www.google.com/patents/US20030070109?dq=5311516
Timestamp: 2017-04-29 06:33:03
Document Index: 34568145

Matched Legal Cases: ['art 41', 'art 42', 'art 41', 'art 42', 'art 51', 'art 52', 'art 53', 'art 54', 'art 51', 'art 52', 'art 53', 'art 54', 'art 51', 'art 51', 'art 53', 'art 54', 'art 54', 'art 51', 'art 53', 'art 54', 'art 53', 'art 54', 'art 53', 'art 54', 'art 51', 'art 53', 'art 54', 'art 54', 'art 41', 'art 42', 'art 54', 'art 41', 'art 42']

Patent US20030070109 - Automatic read reassignment method and a magnetic disk drive - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsAn automatic replacing method is applicable to a magnetic disc drive used particularly in reading data. When a sign that a unit (sector) at which information is handled may be defective at the time of a reading error is detected (saving threshold), the information in that unit is temporarily stored (saved)...http://www.google.com/patents/US20030070109?utm_source=gb-gplus-sharePatent US20030070109 - Automatic read reassignment method and a magnetic disk driveAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20030070109 A1Publication typeApplicationApplication numberUS 10/298,659Publication dateApr 10, 2003Filing dateNov 19, 2002Priority dateAug 2, 2000Also published asUS6513135, US6766465, US20020019959Publication number10298659, 298659, US 2003/0070109 A1, US 2003/070109 A1, US 20030070109 A1, US 20030070109A1, US 2003070109 A1, US 2003070109A1, US-A1-20030070109, US-A1-2003070109, US2003/0070109A1, US2003/070109A1, US20030070109 A1, US20030070109A1, US2003070109 A1, US2003070109A1InventorsMasutaka HaradaOriginal AssigneeMasutaka HaradaExport CitationBiBTeX, EndNote, RefManPatent Citations (5), Referenced by (15), Classifications (10), Legal Events (6) External Links: USPTO, USPTO Assignment, EspacenetAutomatic read reassignment method and a magnetic disk drive
US 20030070109 A1Abstract
An automatic replacing method is applicable to a magnetic disc drive used particularly in reading data. When a sign that a unit (sector) at which information is handled may be defective at the time of a reading error is detected (saving threshold), the information in that unit is temporarily stored (saved) in a temporary storage area (backup area). If the unit showing the sign is judged to be definitely defective, the information in that unit is transferred to a safe storage area (replacement area). Thus, fatal reading errors and negligible reading errors can be treated separately. Images(12) Claims(1)
What is claimed is: 1. An automatic read reassignment method, comprising the steps of: an inputting step for inputting a read command issued from a host to read a desired data from a magnetic disk media; a retry step for retrying a read operation when an error is generated in the read operation; a recovering step in which a read operation completes normally; and a storing step for storing a read data to a back-up area. Description
[0001] The present application is a continuation of application Ser. No. 09/946,724, filed Sep. 6, 2001; which is a continuation of application Ser. No. 09/630,735, filed Aug. 2, 2000, now U.S. Pat. No. 6,393,580, the contents of which are incorporated herein by reference.
FIELD OF THE INVENTION [0002] The present invention relates to magnetic disk drives of the type used for information storage in electronic computer systems, including personal computers and work stations, and especially to an automatic reassignment function that improves the reliability of storage data. BACKGROUND OF THE INVENTION [0003] Generally, with the increase in the storage capacity of a data storage device that operates as peripheral equipment in a computer system, the reliability of stored data has become more and more important. [0004] When computer systems read data from or write data to a unit on a data storage media, a read unable error or a write unable error often occurs for some unknown reason. The result of these kinds of errors is that data cannot be read out in spite of the receipt of a read instruction from an upper system, or data is found to be abnormally written when reading the data after a write operation that responds to a write instruction from the system. [0005] In these cases, as one of the methods of improving the data reliability in a data storage, an automatic reassignment scheme has been adopted. Here, an automatic reassignment is defined as a technique in which a copy of a recorded unit of data (for example, sectors on a track on magnetic disk media in a magnetic disk drive) is prepared beforehand in a data storage, separately from the set of the recording unit of data, and the copy is used instead of the original, if necessary. [0006] The probability of occurrence of data errors in magnetic disk drives of the type that are used as external memory devices is higher than that of conventional drives, since their recording densities are much higher and their total storage capacities have become much larger than ever. Therefore, in the magnetic disk drives for personal computers, an automatic reassignment function for sectors having defects (defective sectors) is generally adopted. And, if write errors occur, the data will be written to an alternative area. When read errors occur, by watching the number of retries and writing the data to the alternative area, the reliability of the data is improved. [0007] It is important for any automatic reassignment technique to determine when to start execution of a read reassignment process with a suitable timing and how to secure the data integrity. Many different techniques have been proposed for these purposes. For example, as disclosed in a Japanese unexamined patent publication Hei 6-75717, entitled “Read error recovery system for a hard disk drive”, a subtle or fine displacement between a magnetic head and a magnetic disk media is avoided by executing re-reading and writing of data to the same destination area, when a read error occurs, if the data is read normally before a number of the re-reading operations reaches a predetermined number. If the number of re-reading operations is equal to the predetermined number or more, an attempt is made to improve the reliability of the read data by executing the reassignment process to another area (to store the data to an alternative area). Hei 6-75717 discloses a system in which a re-read is executed when a read error occurs; and, if the data is read correctly before the number of re-reads reaches a predetermined number, the system writes the data to the same area. [0008] If a subtle or fine displacement between a magnetic head and a magnetic disk media is the cause of an error, an execution of repeated data write operations may be effective. But if an error is caused by the existence of an infinitesimal bad spot (an infinitesimal defective region) on a sector, that is, by media defects, there is a tendency to repeat the retry of a read operation even though the write operation has been performed normally. SUMMARY OF THE INVENTION [0009] The present invention applies an automatic reassignment technique, especially at the time of a read operation, to a magnetic disk drive and performs the following controls. [0010] The present invention proposes to determine a symptom of a unit that handles data, which symptom is the cause of a failure resulting in the occurrence of a read error on the unit, and the data of the unit is temporarily stored (back up process) in a temporary storing area (back up area). If the symptom of the failure is considered to represent a definite failure, the data of the unit is shifted to a safe storing area (alternation area). As a result, a fatal read error and a temporary read error are treated differently. [0011] In other words, a priority level of candidates among data to be shifted to the alternation area is determined dynamically by referring to the number of retry operations related to the read errors. The unit of data is stored in the temporary storing area, which is a back up area, based on the state of the accumulated number of retries after the temporary storing, time stamps of data and so on. [0012] The present invention does not renew directly the data content of an area, or a unit or a sector to handle data when a normal read is performed before the number of retries reaches a predetermined number, as in the conventional technology. In accordance with the present invention, under such circumstances, a data write command is not executed to the area, the unit, nor the sector to handle the data. Rather, the content of data is held in a back up area prepared in advance and is controlled using a back up data table. Concerning the unit that is judged to be definitely defective among the units of data held in the back up area, the content of the definitely-defective unit is transferred to the alternation area, and the reliability of stored data is improved even if a read error has occurred. [0013] In the magnetic disk device that is provided with an automatic read reassignment function, [0014] 1) A back up area that holds the user data temporarily, an alternation area that serves as a substitute for the failed area or sectors, and a control area that stores control data are formed on a magnetic disk media in advance, in addition to the user data area that stores the data of the user (or the data of an electronic computer system) that uses the storage function of the magnetic disk device. [0015] 2) When a write command is accepted from a host (host processing unit or electronic computer system) to a sector where an error has occurred at the prior read processing, and the read processing is recovered by a retry processing, the data in the sector to be backed up (the sector that is read recovery processed) will be revised. At this time, the data is written (a duplicated writing of the same data) to the original sector and the back up area (more specifically, the sector in which data is held in the back up area). [0016] 3) For an error that occurs during read processing to a sector, a function to judge whether the sector has the symptom of a failure or not is provided and a back up process using a back up area is performed. That is, the back up process has a threshold value in the retry process in the read operation, and if the read operation is performed normally after a number of retries exceeding the threshold, the data of the sector is held in the back up area. [0017] 4) When the original sector cannot be read, the data at the back up sector is used. [0018] 5) The system has a function for judging that a sector is defective when 15 an error has occurred in the process of a read operation for the sector and, in such case, for executing a reassignment process of the data to an alternation area. That is, in the retry processing of a read operation, a threshold value for the number of retries is provided, and when the number of the retries exceeds the threshold value, the sector is judged to be defective. [0019] 6) An alternation processing is controlled based on a reassignment data table including a reassigned address recording part that registers a defective sector address, and a reassigning address recording part that registers the address of the alternative storing sector which is used for the alternation of the defective sector. [0020] 7) The back up process is controlled by a back up data table having a backed up address recording part that registers addresses of sectors with the symptom of defects, a back up address recording part that registers temporary addresses of the sectors that store the data of the sectors with the symptom as a temporary storage, an accumulated number of retries recording part that records an accumulated number of retries, and a priority order recording part that controls a priority order of recording. Each registration in the back up data table is assigned a priority; for example, as the accumulated number of the retries is larger, the priority is higher. A newly found sector that has the symptom of a defect is registered without fail (the registering of defective sectors and other parameters are arbitrary to be registered) and the sectors accessed latest and with a larger accumulated number of retries are assigned a higher priority.
BRIEF DESCRIPTION OF THE DRAWINGS [0021] [0021]FIG. 1 illustrates an alternation data table included in the control tables of the automatic reassignment control technology of the present invention. [0022] [0022]FIG. 2 illustrates a back up data table included in the control tables of the automatic reassignment control technology of the present invention. [0023] [0023]FIG. 3 is a block diagram of a host and a magnetic disk device that is integrated with a memory. [0024] [0024]FIG. 4 is a diagram which shows a concept of each storage area on the magnetic disk media. [0025] [0025]FIG. 5 is a diagram that illustrates the registration of data when there is a space in the back up data table of the present invention. [0026] [0026]FIG. 6 is a diagram that illustrates the additional registration of the data when the back up data table of the present invention is full. [0027] [0027]FIG. 7 is a diagram that illustrates the revising the number of retries that have already been registered to the back up data table of the present invention. [0028] [0028]FIG. 8 is a diagram that illustrates the deletion of the address that has already been registered to the back up table of the present invention by the alternation processing. [0029] [0029]FIG. 9 is a flow chart of the process of reading user data from the magnetic disk device of the present invention. [0030] [0030]FIG. 10 is a flow chart of the process of the back up processing to the back up area. [0031] [0031]FIG. 11 is a flow chart of the process of the alternation processing to the alternation area. [0032] [0032]FIG. 12 is a flow chart of the process when there is data unable to be read. [0033] [0033]FIG. 13 is a flow chart of the process of a data write operation after the execution of back up processing and alternation processing.
MOST PREFERRED EMBODIMENT FOR THE IMPLEMENTATION OF THE PRESENT INVENTION [0034] [0034]FIG. 1 to FIG. 13 illustrates an embodiment for the implementation of the present invention. [0035] [0035]FIG. 3 shows an example of the configuration of a personal computer system that uses a magnetic disk device 3 integrated with a memory 33. The personal computer has a central processing unit or host computer 1 and the magnetic disk device 3 operating as an external memory device. This basic configuration can be employed where a host 1 is the host of a large computer system and the magnetic disk device 3 operates as an external memory device. [0036] The magnetic disk device 3 comprises a microprocessor 31, a hard disk controller 32, a memory 33 and a disk unit (magnetic recording medium) 2. The microprocessor 31 controls the magnetic disk device 3. The hard disk controller 32 takes part in transmitting and receiving data and commands of the host 1 and the disk unit 2. The memory 33 has an area for holding data accessed from the host 1, an area to store an alternation data table 4 based on control data stored in the disk unit 2, and a back up data table 5. [0037] [0037]FIG. 4 shows the configuration of the disk unit 2. Tracks 22 are arranged in a concentric circular form on the both sides of the individual disks, which represents a plural recording medium. On each track 22, plural sectors that represent a kind of the recording units of the data are formed. On the both sides of each disk, magnetic heads, the distances of which from the rotational center of the disk are almost the same, move radially in the same direction at the same time on the disk surface to position the magnetic heads (seeking operation) on the objective track 22, and these magnetic heads are arranged facing the respective surfaces of the magnetic disks. Through the magnetic heads, the writing and reading of said sectors in any of the tracks 22 are performed. The track 22 has a user data area 22 a, which the data is written to and read from, a control area 22 b in which the alternation data table 4 and the back up data table 5 are stored, an alternation area 22 c that stores the data produced in the alternation processing, and a back up area 22 d that stores the backed up data in the back up processing. [0038] Any access from the host 1 to a sector is executed by assigning addresses, such as cylinder number, head number and sector number of the cylinder 21. [0039] [0039]FIG. 1 shows an example of the configuration of the alternation data table 4 and FIG. 2 shows an example of the configuration of the back up data table 5. These tables are stored in the control area 22 b of the disk 2. Just after the power of the magnetic disk device is turned on, or before writing to or reading from the magnetic disk unit 2, these tables are developed and stored into the storing area of the memory 33 and the alternation processing and the back up processing are controlled using these tables. This control data can be stored in the control area 22 b before power off, or at a predetermined time period after the power on of the magnetic disk device, in order to prepare for its use after the next power on. [0040] The alternation data table 4 (FIG. 1) has a recording part 41 storing an address to be backed up and a recording part 42 storing a back up address. These addresses are configured when a defect of a sector is generated. In this regard, the address of a defective sector is registered to the recording part 41 as the address to be backed up, and an address of an alternative sector is additionally registered to the recording part 42 as a back up address in the alternation data table 4. Accordingly, the disk unit 2 can be accessed without accessing the defective sector in a writing or reading operation. [0041] The back up data table 5 (FIG. 2) is provided with a recording part 51 storing an address to be backed up, a recording part 52 storing a back up address, a recording part 53 indicating an accumulated number of retries and a recording part 54 indicating the priority order of the entry. When a sector read from the disk 2 is judged to be a sector that has a symptom of a defect (a defect symptom sector), an address of the defect symptom sector and a back up address are registered in the backed up address recording part 51 and the back up address recording part 52, respectively. Hereby, when it suddenly becomes impossible to read the defect symptom sector at the next read timing, a read error can be avoided by reading the storage area identified by the back up address. [0042] To avoid a deterioration of performance owing to the duplicated writing of the addresses to be backed up and the back up addresses, the number of entries to the back up data table 5 is limited, and this is controlled using the accumulated number of retries recording part 53 and the priority recording part 54. In this way, the back up data with a higher priority can always be held on the drive. [0043] In an actual case, a second number of retries N2 (an alternation processing threshold value) and third number of retries N3 (a back up processing threshold value) are set in addition to a maximum number of retries N1 for control of the upper limit number of retries. The number of retries N2 is a parameter used to determine whether the alternation processing should be performed or not, and it is smaller than the maximum number of retries N1. The number of retries N3 is a parameter used to determine whether the back up processing should be performed or not, and it is smaller than the number of retries N2 (but N3 is not zero). [0044] When a read error is generated at the time of reading from the disk 2, the reading process is performed again. When a retry of the reading is normally accomplished with a number of retries that exceeds the threshold value of the back up processing and that is equal to or less than the threshold value of the alternation processing, the sector is judged to be a defect symptom sector. The read sector data is written to the back up area and the back up data table 5 is updated. [0045] When a read operation is normally performed with the number of retries exceeding the threshold value of the alternation processing, the sector is judged to be a defect sector, the read sector data is written to the alternative area and the alternation data table 4 is updated. [0046] If normal reading cannot be performed with the number of retries reaching the maximum number of retries N1, the back up data table 5 is accessed, and when the address of the sector is registered in the recording part 51 as an address to be backed up, the sector identified by the back up address in the back up area is read. Then, the address to be backed up that cannot be read is judged to be a defective sector address, the data at the back up address is written to the alternative area, the alternation data table 4 is updated and the read unable condition is avoided. The process of updating the back up data table 5 by the implementation of the present invention is illustrated in FIG. 5 to FIG. 8. The maximum number of entries in the table 5 is 5 in this example. [0047] In FIG. 5, when there is room in the back up data table 5 (5 a entry in the table, while 5 b to 5 k and 5 m indicate revised entries), and when an additional entry for a defect symptom sector is needed, the address of the defect symptom sector is registered in the recording part 51 as an address to be backed up and the number of retries is registered in the recording part 53 as an accumulated number of retries (5 b). The accumulated number of retries is compared to the other accumulated numbers of retries that have already been registered to the back up data table 5. If the accumulated number of retries is equal to or more than the other accumulated numbers in one or more other entries, the priority of it is set higher than the priority of those entries, and the priority recording part 54 is updated accordingly (5 c). Hereby, the data of the defect symptom sector can be guaranteed. [0048] In FIG. 6, when an additional entry for a defect symptom sector is needed in the table 5 after the number of registrations reaches the maximum registration number, the registration (5 d) which has the least significance in the priority recording part 54 is deleted, and the address of the new defect symptom sector is registered in the address recording part 51 as an address to be backed up and the number of retries is registered to the accumulated number of retries recording part 53 (5 e). Similar to FIG. 5, the accumulated number of retries is compared to the numbers of retries that have already been registered, and when the accumulated number of retries is equal to or more than those of other accumulated numbers in one or more other entries, it is given a higher priority than the priority of those entries, and the priority recording part 54 is updated accordingly (5 f). Hereby, the data of the defect symptom sector that has been recently accessed can be guaranteed. [0049] In FIG. 7, when the number of retries that is judged to be the symptom of a defect is generated at an address to be backed up (5 g) that has already been registered to the back up data table 5, the recent number of retries is added to the accumulated number of retries recording part 53 (5 h), and if the accumulated number of the retries is equal to or more than the other registered entries, a higher priority is set by that entry, and the priority recording part 54 is updated accordingly (5 i). [0050] In FIG. 8, when the number of retries exceeds the threshold value of the alternation processing at an address to be backed up (5 j) that has already been registered in the back up data table 5, or when the alternation processing is generated by a read unable condition, the address of the sector to be backed up and the accumulated number of retries in the back up data table 5 are deleted from the table 5 (5 k) and the alternation processing is performed. After deleting the registration, the priorities of the other entries are updated accordingly (5 m). The above-described examples are based on N2>five times of retries>N3. The following is an example of an operation of the read automatic reassignment control as a preferred embodiment of the present invention. [0051] [0051]FIG. 9 illustrates the control flow of a read processing. Host 1 (FIG. 3) requests the hard disk controller 32 to read data from the magnetic disk device 3 indicating a cylinder number, a head number and a sector number in the cylinder 21. [0052] The magnetic disk device 3 converts a logical address from the host 1 to a physical address on the disk unit 2 to access the disk unit 2 (FIG. 9, step 101). Then it clears a retry counter to zero (step 102). After that, the data is read from the disk unit 2 (step 103), and then the data is checked to determine if a read error has been generated using the ECC etc. (step 104). [0053] When a read error has been generated, the retry counter is incremented by 1 (step 107), a judgment is made to determine whether the retry counter has exceeded the maximum number of retries N1 or not (step 108), and, if not, the read processing (step 103) is performed again. [0054] If the reading is indicated as having been normally performed at steps 104, the content of the retry counter is checked to see if it is larger than N3 or not (step 105). If the content of the retry counter is equal to N3 (a back up processing threshold value) or less, the read processing is not performed again (step 103), since it is determined that normal reading has been performed, and the read processing requested by the host 1 ends. [0055] If it is determined that the content of the retry counter exceeds N3 (the back up processing threshold value) at step 105, it is checked to determine whether the content of the retry counter has exceeded the alternation process threshold value (N2) or not (step 106). When the content of the retry counter is equal to or less than the alternation processing threshold value (N2), a back up processing to the back up area illustrated in FIG. 10 is performed. When the content of the retry counter exceeds N2, an alternation processing to the alternation area illustrated in FIG. 11 is performed. When the content of the retry counter reaches the maximum number of retries N1 (step 108), the processing of the read unable illustrated in FIG. 12 is performed. [0056] The back up processing to the back up area will be explained with reference to FIG. 10. [0057] First, a search is made to determine whether the address of a sector with an error is registered in the back up data table 5 (step 201). If it is already registered, the recent number of retries is added to the accumulated number of retries recording part 53 of the back up data table 5 (step 203). On the other hand, if it is not registered, whether the number of entries in the back up data table 5 is up to the maximum number or not is checked (step 206), and if there is no room for a new entry in the back up data table 5, the entry with the address to be backed up which has the least significant priority in the priority recording part 54 is deleted (step 207), and an area to register the content of the defect symptom sector that is newly generated, is reserved. This effects preservation with priority of the recently accessed sector. The data of the sector that is newly read is written to the back up area (step 208), the sector address is registered as an address to be backed up in recording part 51 and the number of retries is newly registered to the accumulated number of retries recording part 53 (step 209). As the accumulated number of retries is newly registered or is added to the previously registered number, the priority of the other entries is updated in the priority recording part 54 (step 204). The revised back up data table 5 is written to the back up data storing address of a disk control area (step 205). [0058] The alternation processing to the alternation area as shown in FIG. 11 will be explained next. [0059] First, a search is made to determine whether the sector address is registered as an entry in the back up data table 5 or not (step 301). If it has already been registered, the back up is no longer needed, since the data will be written to the alternation area. Hence, the entry of the sector address in the back up data table 5 is deleted (step 303). In order to re-establish the order of the priority caused by the deletion of the entry from back-up table 5, a revision of the priorities in the priority recording part 54 of the back up data table 5 is performed (step 304). Then, the data is written to the storing address of the back up data table 5 in the disk control area (step 305). The newly read data is written to the alternation area (step 306), the newly read sector address is registered to the address to be backed up recording part 41 of the back-up data table 4, the alternating address of the alternating area is registered to the back-up address recording part 42, and these items are written to the storing address of alternation data table 4 of the disk control area (step 307). [0060] The processing for the case of the read unable condition illustrated will be FIG. 12 is explained. [0061] First, a search is made to determine whether the address of a sector with an error is registered as an entry in the back up data table 5 or not (step 401, step 402). If it is not registered, the processing to report a read error to the host 1 is executed (step 413). If there is a registration in the back up data table 5, the retry counter is cleared to zero (step 403). Then, the back up address of the sector is read from the disk unit 2 (step 404), and it is determined whether an error is generated using the ECC etc. (step 405). [0062] When the reading is performed normally, the entry of the sector address is deleted from the back up data table 5 (step 406). The priority recording part 54 of the back up data table 5 is revised (step 407), and then the data is written to the storing address of the back up data table 5 of the disk control area (step 408). The newly read data is written to the back-up area (step 409), the address to be back-up that is unable to be read is registered to the address to be back-up recording part 41 of the alternation data table 4, the back-up address of the alternation area is registered to the back-up address recording part 42, and those items are written to the storing address of the alternation data table 4 of the disk control area (step 410). [0063] When the back up address cannot be read, the retry counter is incremented by 1 (step 411), and it is determined whether the content of the retry counter is equal to the maximum number of retries N1 or not (step 412). When it is less than N1, the process is repeated from the read processing of the back up address (step 404). When the back up address cannot be read (the number of retries reaches N1), a read error is reported to the host 1 (413). [0064] An example of a write processing operation in the alternation processing and the back up processing described above will be explained. FIG. 13 illustrates the control flow of the write processing. [0065] The host 1 sends the write request to the hard disk controller 32 in the magnetic disk device 3 indicating the cylinder number, the head number, the sector number of a cylinder 21. The magnetic disk device 3 converts a logical address to a physical address for accessing the disk unit 2 (step 501) and searches into the alternation data table 4 before writing data to the disk unit 2 (step 502). [0066] If the address of the sector is registered in the alternation data table 4, the physical address is reassigned to the back-up address (step 509). Then, a search is made to determine whether the accessing address is registered to the back up data table 5 (step 504). When it is registered, a back up processing flag that indicates that back up processing has been executed is set to 1 (step 510). When it is not registered, the back up processing flag is set to 0, in other words, to clear the back up processing flag (step 506). Then, the write processing is executed (step 507), and when the back up processing flag is 1, the same data is written to the back up address (step 511). In this way, the data corresponding to the address to be backed up and the data of the back up address, which addresses are registered in the back up data table 5, are kept the same. Therefore, when a read error is generated at the address to be backed up, the data of the back up address can be referred to because the addresses are registered in the back up data table 5. [0067] The present invention extends the practical life of the magnetic disk drive, suppressing an elongation of the data access time caused by retries. More specifically, because the magnetic disk device 3 of the present invention has, besides the alternation data table 4 that controls the defective sector, the back up data table 5 that keeps the address to be backed up and the back up address of the defect symptom data sector, and the back up area including the back up address to which data is backed up, the defect symptom data sector can be guaranteed. [0068] Because the back up data table 5 has a recording part that holds the accumulated number of retries and the disk drive system can determine the priority based on the accumulated number of retries, frequently used data can be guaranteed. [0069] In the case of a read unable condition, the condition can be avoided if the content of the sector that cannot be read is registered in the back up data table 5. Therefore, a magnetic disk device with the least possibility of losing data can be achieved. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS6279089 *Apr 12, 1999Aug 21, 2001Western Digital Technologies, Inc.Defective data site management through a shared defect management tableUS6330641 *May 19, 1999Dec 11, 2001Nec CorporationMethod and apparatus for controlling magnetic disk deviceUS6393580 *Aug 2, 2000May 21, 2002Hitachi, Ltd.Automatic read reassignment method and a magnetic disk driveUS6513135 *Sep 6, 2001Jan 28, 2003Hitachi, Ltd.Automatic read reassignment method and a magnetic disk driveUS6625755 *Nov 10, 1999Sep 23, 2003Hitachi Software Engineering Co., Ltd.Storage apparatus and control method thereof* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7788541 *Jul 31, 2008Aug 31, 2010Dot Hill Systems CorporationApparatus and method for identifying disk drives with unreported data corruptionUS7945813 *Apr 13, 2007May 17, 2011United Services Automobile Association (Usaa)Automated delayed message redeliveryUS7975171 *Sep 4, 2008Jul 5, 2011International Business Machines CorporationAutomated file recovery based on subsystem error detection resultsUS8214688May 17, 2011Jul 3, 2012United Services Automobile Association (Usaa)Automated delayed message redeliveryUS8260749Dec 8, 2009Sep 4, 2012Emc CorporationTraversing data in a repeatable mannerUS8504872Jul 3, 2012Aug 6, 2013United Services Automobile Association (Usaa)Automated delayed message redeliveryUS8830613 *Aug 22, 2012Sep 9, 2014Lsi CorporationStorage media inter-track interference cancellationUS8902532Mar 20, 2013Dec 2, 2014International Business Machines CorporationWrite avoidance areas around bad blocks on a hard disk drive platterUS20050280914 *Jun 21, 2004Dec 22, 2005Lee Yeong KRetry reordering in hard disk drivesUS20080065637 *Apr 14, 2005Mar 13, 2008Emc CorporationLocating last processed dataUS20080065663 *Apr 14, 2005Mar 13, 2008Emc CorporationReestablishing process contextUS20090070539 *Sep 4, 2008Mar 12, 2009International Business Machines CorporationAutomated File Recovery Based on Subsystem Error Detection ResultsUS20090259882 *Jul 31, 2008Oct 15, 2009Dot Hill Systems CorporationApparatus and method for identifying disk drives with unreported data corruptionUS20100094807 *Dec 8, 2009Apr 15, 2010Emc CorporationTraversing data in a repeatable mannerUS20130223199 *Aug 22, 2012Aug 29, 2013Timothy B. LundStorage media inter-track interference cancellation* Cited by examinerClassifications U.S. Classification714/2, G9B/19.005, G9B/20.046International ClassificationG11B19/04, G11B20/18Cooperative ClassificationG11B20/18, G11B2020/183, G11B19/04European ClassificationG11B20/18, G11B19/04Legal EventsDateCodeEventDescriptionJan 27, 2005ASAssignmentOwner name: HITACHI GLOBAL STORAGE TECHNOLOGIES JAPAN, LTD., JFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HITACHI, LTD.;REEL/FRAME:015642/0704Effective date: 20050120Dec 28, 2007FPAYFee paymentYear of fee payment: 4Dec 21, 2011FPAYFee paymentYear of fee payment: 8Feb 26, 2016REMIMaintenance fee reminder mailedJul 20, 2016LAPSLapse for failure to pay maintenance feesSep 6, 2016FPExpired due to failure to pay maintenance feeEffective date: 20160720RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services