JP2000149403A - Rotary storage device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To avoid deterioration in performance accessing a user data area where alternating processing has been executed. SOLUTION: Each of plural notches 103 (1-n) constituted by dividing a rotary storage medium into plural segments is comprised of a user data area 103a and two alternate areas 103b, 103c, which are placed in front of and behind the user area. When a defective sector (dmn) occurs in the user data sector (Dmn) within the user data area 103a, an alternate sector (Rmn) in the alternate area 103b or 103c nearer to the occurrence position is assigned thereto, and also, an increase in an access time to the data in the notch n associated with the alternating processing is suppressed by rearranging in a physical order the user data sector (Dmn) in the user area 103a and the alternate sector (Rmn (dmn)) in the alternate area 103b or 103c at a desired opportunity.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a rotary storage device, and more particularly, to a rotary storage device having a replacement processing function of dynamically assigning a medium defect area generated during operation to a replacement area. Regarding effective technology.

[0002]

2. Description of the Related Art For example, in a rotary storage device provided with a rewritable rotary storage medium such as an optical disk, a magneto-optical disk, and a magnetic disk, a defective sector generated after a write process is performed by a user is used. It is known to perform a replacement process for dynamically allocating a replacement sector.

Conventionally, several methods have been proposed for the replacement processing function of a rotary storage device. In the rotary storage device, when user data is written after the device is shipped, a defective sector may occur due to a defect on the medium. Therefore, in order to guarantee the user data, the entire user data area is formatted beforehand when the apparatus is shipped, and if a defective sector exists on the medium, it is registered as a defective sector so that the medium cannot be used by the user and a medium failure occurs. It does not happen.

FIG. 18 is a conceptual diagram showing a sector arrangement when a defective sector occurs in a certain sector on a medium in the reference technology. The upper part is an allocation diagram of user data in which no defective sector has occurred. The lower part is an allocation diagram of user data when a defective sector occurs.

In FIG. 18, D0 to Dn represent user data sectors (logical block addresses 0 to n).
The marks represent defective sectors. When a defective sector equal to or larger than the threshold occurs on the same track, the track is treated as unusable and the next track is allocated.

Further, in consideration of a case where a defective sector occurs at a user site after shipment, a replacement area for replacing data of the defective sector is provided. As a result, in the defective sector generated when the user uses the data, the user data to be written to the defective sector is written in the first sector of the empty sector in the provided spare area.

FIG. 19 is a conceptual diagram illustrating a case where a certain sector on a medium becomes a defective sector and a replacement process occurs in the reference technology. The upper part shows a case where a defective sector is generated, and the lower part shows a case where D3 and D5 are defective sectors and replacement processing is performed. In the figure, dn represents a replacement sector of Dn.

[0008] Regarding the arrangement of the spare area, it has been previously performed to provide a spare area at the end for each track. However, due to technical problems such as an increase in unused spare areas and a decrease in storage capacity, At present, the medium is divided into several areas as shown in FIG. 20 (hereinafter referred to as a notch area),
A replacement area provided behind each notch area is used. As a result, if a defective sector occurs after shipment, the present rotary storage device physically writes the data that should be written to the defective sector position to another area in order to guarantee the user data. Is not a continuous arrangement.

Here, when six sectors D0 to D5 are read in the case where the replacement process is performed as shown in FIG. 19, (1) D0 to D2 are read as shown in FIG.

(2) Read the replacement sector d3.

(3) D4 is read.

(4) Read the replacement sector d5.

As described above, since the medium is accessed in the order of the logical block addresses, the medium cannot be read at once, and the performance is lower than before the defective sector occurs due to the seek time and the rotation waiting time occurring during the operation. Was.

Similarly, when the replacement process is performed as shown in FIG. 19, when writing six sectors D0 to D5, the same access order as in FIG. Write D2.

(2) Write d3 to the replacement sector destination.

(3) D4 is written.

(4) Write d5 to the destination of the replacement sector.

As described above, since the medium is accessed in the order of the logical block addresses, the performance is reduced as in the case of reading.

In order to solve such a technical problem at the time of reading, for example, in the technique of Japanese Patent Application Laid-Open No. 9-35418, there are a plurality of continuous defective sectors on the user data area and the order of the defective sectors. In the places where the order relationship of the replacement sector corresponding to each defective sector does not match, the order of the replacement sector is rearranged so as to match the order relationship of the defective sector, the number of accesses to the replacement area is reduced, and the performance is improved. Have been proposed.

[0020]

In the conventional rotary storage device having a replacement processing function, when a defective sector occurs on the user data as described above, the defective sector is replaced with a replacement area. As a result, user data can be guaranteed, but the area containing those defective sectors is read,
Alternatively, in the case of writing, it is necessary to access each of the replacement sectors that are not physically arranged continuously. As a result, a seek time and rotation wait for several replacement sectors are generated, which leads to a decrease in performance.

Further, in the case where the rearrangement is performed so that the order relationship of defective sectors and the order relationship of each replacement sector replaced in the replacement area match in the replacement area as in the technique of Japanese Patent Application Laid-Open No. 9-35418. In the case where the replacement sectors are consecutive, the replacement sectors can be read in a lump, so that unnecessary rotation waiting does not occur and the performance can be improved as compared with the case where the replacement sectors are not rearranged. If not, a rotation wait of up to several times in the replacement sector will occur at the maximum, which may lead to performance degradation.

Generally, in such a rotary storage device,
The format command is supported, and when executed, the entire user data area is formatted, and the replacement sector can be allocated to the next sector after the defective sector to minimize unnecessary rotation wait during access. Yes, but the previously recorded user data will be erased.

An object of the present invention is to provide a rotary storage device capable of suppressing an increase in the required access time due to the replacement process and improving the access performance.

Another object of the present invention is to provide a rotary storage device capable of realizing an improvement in access performance by optimizing the allocation of a spare area in a spare process without losing user data. is there.

[0025]

According to the present invention, a sector (unit area) which is physically replaced at a discontinuous position by the replacement process is replaced with a user data area sector forming a notch and a replacement area as shown in FIG. Reorder the sectors so that they are contiguous. At this time, in order to suppress an increase in the number of sectors to be rearranged, in the present invention, a replacement area is provided before and after each user data area (notch), and an area close to a defective sector is selected. And the sectors in the replacement area are rearranged. At this time, the replacement sectors are arranged in a position far from the user data of the notch, that is, in the first half of the replacement area, and in the second half of the replacement area, in order to secure an area for performing the rearrangement processing.

According to the present invention, if defective sectors are concentrated in the first half or the second half of the notch, the spare area may be insufficient. Therefore, when the spare area is insufficient, the other of the alternative notch is used. Use a replacement area.

If the rearrangement process of the present invention is performed after the command processing at the time of executing the command, the command may time out depending on the number of sectors to be rearranged. Issued from the host.

If there is no processing time for rearranging when the power is turned on, a time is set in advance by the host, and if no drive access is performed during this time, the rearranging process is executed.

[0029]

Embodiments of the present invention will be described below in detail with reference to the drawings.

FIG. 1 is a conceptual diagram showing an example of the operation of a rotary storage device according to an embodiment of the present invention, and FIG.
FIG. 3 is a conceptual diagram showing an example of a configuration of a notch which is a user data area set on a rotary storage medium in a rotary storage device according to an embodiment of the present invention. FIG. 2 is a conceptual diagram illustrating an example of a configuration of a rotary storage medium in a certain rotary storage device.

As illustrated in FIG. 3, the storage area of the rotary storage medium 100 in the rotary storage device of the present embodiment is composed of a management area 101 and a management area 102 arranged at the beginning and end, respectively. , This management area 101
And a plurality of notches 103 (notches 1 to n) obtained by dividing a storage area other than the management area 102 into a plurality.

Each of the notches 103 includes a user data area 103a (user data areas 1 to n) arranged at the center of the notch 103, and the user data area 1 before and after the user data area 103a.
Plural replacement areas 103b arranged so as to sandwich the area 03a
(Replacement area 1-0 to n-0) and replacement area 103c
(Replacement areas 1-1 to n-1).

As illustrated in FIG. 2 and FIG. 3, the user data area 103a of any notch n in the present embodiment
Is composed of a plurality of user data sectors D00 to mn (unit areas, 20 in this embodiment, D00 to D19), and the replacement areas 10 arranged before and after it are respectively arranged.
3b includes a plurality of replacement sectors R00 to R0n (unit area,
In the case of the present embodiment, the replacement area 103c includes five replacement sectors R0n + 1.
To Rxy (unit area, in this embodiment, R05 to Rxy
04 (5 pieces). That is, in FIG. 2, Dmn indicates a user data area sector, and Rxy indicates a replacement area sector.

In FIG. 2, when defective sectors occur in the order of D02 and D06 and replacement processing is performed, in this embodiment, two replacement areas 103b (n-0) and 103
The replacement process is performed on the replacement area n-0 on the physically closer side of c (n-1) with the first place. At this time, the sector arrangement is as shown in FIG. In FIG. 4, D13, D17, D
In the case where defective sectors are generated in the order of 14 and the replacement process is performed, the replacement process is performed in the replacement area n-1 after the last. At this time, the sector arrangement is as shown in FIG. In FIGS. 4 and 5, the hatched sectors represent defective sectors, and dmn represents the position of the replacement sector of Dmn.

FIG. 6 is a conceptual diagram showing an example of a replacement management table for managing replacement information at this time. The replacement management table 200 includes a replacement area n-0 and a replacement area n for each notch.
A plurality of entries 201 and entries 202 provided by the number of replacement sectors for managing the replacement position information of −1, respectively, and entries 203 and 2 for managing the number of replaced sectors and the replacement free area.
04 is included. Based on this information, first, the replacement area n-
Rearrange 0. An example of the flow of the rearrangement process in the case of FIG. 5 is shown in the flowchart of FIG. 7, and the arrangement state of the sectors after rearrangement is shown in FIG. The sectors to be rearranged are from the first user data sector to the last defective sector in the first half of the user data area 103a of the notch n. In the case of FIG.
06. The number of replacement sectors is determined by the user data area 103.
The number of sectors (the number of defective sectors in the first half of the user data area 103a) replaced in the replacement area 103b (n-0) in the first half of the area a.

In the case of this embodiment, if the rearrangement process is performed after the command processing when executing the command received from the higher-level device, the command may time out due to the size of the rearranged sectors. Or when a command interface such as a rearrangement processing command for specifying the execution timing of the rearrangement process is provided between the host device and the host device, and the execution timing is specified from the host device.

If there is no processing time for rearranging when the power is turned on, a time zone for rearranging is set in advance by a predetermined command interface from the host device, and no drive access is performed during this time zone. If it is, the sorting process is executed.

In the process shown in FIG. 7, it is determined in step # 11 whether the rearrangement process in progress flag is set. This is used for determination of resumption when the rearrangement process is interrupted due to power interruption or reception of another command during execution.

If the flag is not set, step # 11
After the process execution flag is set in step a, step # 12
Creates the sorting group management table 300. In each group, sectors to be rearranged are grouped for each defective sector in the first half user data area 103a. Each group in the case of FIG.
00, D01], [d02], [D03, D04, D0
5] and [d06]. The entry corresponding to each group in the rearranged group management table 300 includes a group number 301, a head logical block address 30 of the group.
2. Last logical block address 303, number of group sectors 304, rearranged completion first logical block address 30
5, the rearrangement completion final logical block address 306 and the rearrangement completion sector number 307 are managed. In the case of FIG. 5, the state before the execution of the sorting of the sorting group management table 300 is as shown in FIG.

In step # 13, the number of rearranged groups N,
Then, a rearrangement destination table pointer tp (pointing to the group number 301 in the rearrangement group management table 300) is set. In the case of FIG. 5, N = 5 and tp = 1. The rearrangement read pointer RD. p (top logical block address of the group of the table entry pointed to by tp), and the rearrangement write pointer WR. p (from the first sector position of the first half of the user data area 103a,
A position ahead of the replacement area 103b (n-0) by the number of defective sectors) is set.

In step # 14, the read position of the rearranged sector is calculated. This is the RD. It is p ahead.

In step # 15, the write position of the rearranged sector is calculated. This is the WR. It is p ahead.

In step # 16, the total number m of sectors to be rearranged (seven in FIG. 5) is compared with the number b of free buffer capacity sectors.

In step # 17, the rearranged sector RD
(1) Perform processing. This processing is RD. This is a process of reading all m sectors to be rearranged from the p destination into the buffer while referring to the rearrangement group management table 300.

Steps # 18 to # 20 are necessary when the rearrangement process is performed a plurality of times because all the rearrangement target sectors are not included in the buffer.

In step # 18, a swap processing determination is executed. The swap process described here means that among sectors to be rearranged, sectors that have not been rearranged yet are overwritten with rearranged sectors in order to prevent overwriting of those sectors. This is a process of saving data in a spare area or a free area of the management area.

In step # 19, the rearranged sector RD
(2) Perform processing. This processing is performed in RD. Sort the sectors to be sorted from the p-destination group management table 300
Is read into the buffer while referring to.

At step # 20, the continuation flag is set because the rearrangement process is not yet completed.

In step # 21, WR. The data read in step # 17 (or # 19) is written from the p-th destination. If there is a defective sector in the middle, a slip WR process of skipping the defective sector and sequentially arranging the sectors is performed.

In step # 22, the continuation flag is referred to. If the continuation flag has been set, the process proceeds to step # 23, and if completed, the process proceeds to step # 24.

In step # 23, the rearranged group management table 300, RD. p, and WR. Update p. The rearrangement start logical block address is t before update.
This is a value obtained by adding the number of sectors read in step # 19 to the leading logical block address of the p-th destination. RD. p
And WR. p is the WR. This is a value obtained by adding the number of sectors that have been rearranged and written to p. tp is R
D. Update to point to the group containing the p-destination logical block address. Further, the continuation flag is reset. After this process, the process returns to the process of step # 14.

In step # 24, the replacement management table 200
Is updated, and the rearrangement process in progress flag is reset in step # 24a to end the rearrangement process.

In FIG. 5, the replacement area 103b (n-
Table 300a in FIG. 10 shows the result of the sector movement of each group and the updated values of the rearrangement group management table 300 when the rearrangement is executed in step (0). Table 3 in FIG.
In the entry corresponding to each group of 00a, the upper row indicates the sector position in FIG. 17 and the lower brackets indicate the user data at that time.

By the above processing, as shown in FIG. 5, the sectors D00, D01, d02, D03, D04, D0
5 and d06 are R03, R04 and D0 in FIG. 2, respectively.
Data is written to the positions 0, D01, D03, D04, and D05.

Subsequently, the replacement area 103c (n-1) is rearranged. The sectors to be rearranged are from the first defective sector in the latter half of the user data area 103a of the notch to the last user data sector in the notch. In the case of FIG. 5, d13 to D19. The number of replacement sectors is the number of sectors replaced in the replacement area 103c (n-1) behind the user data area 103a (the number of defective sectors in the latter half of the user data area 103a).

FIG. 1 shows an arrangement state after the rearrangement in the case of FIG. The processing flow is the same as the rearrangement of the first half area.

The rearranged group management table 300 in step # 12 has the following [], [d13], [d]
14], [D15, D16], [d17], [D18,
D19]. Sorting group management table 300
In the case of FIG. 5, the entries of each group are as shown in FIG.

In step # 16, the total number m of sectors to be rearranged (seven in FIG. 5) is compared with the number b of free buffer capacity sectors.

In FIG. 5, when the number of free buffer sectors is b = 3 (when swap processing occurs), the result of the movement of the sectors in each group when the replacement of the replacement area n-1 is performed is performed. The updated values of the group management table 300 are shown in a table 300b of FIG. FIG. 2 shows an entry corresponding to each group in the table 300b of FIG.
, The user data at that time is shown in the lower parenthesis. In FIG. 12, K represents data swapped to a free area of the management area 101 or 102.

By the above processing, the sector d1 shown in FIG.
3, d14, D15, D16, d17, D18, D19
Are respectively D14, D15, D16, D18, D in FIG.
19, R05 and R06 are written. As a result, since the user data D00 to D19 are continuously arranged on the medium as in this example, it is possible to eliminate seek and rotation waiting time caused by accessing the spare area, which has conventionally been a problem. Access performance is improved.

Here, updating of the replacement management table 200 when the above rearrangement processing is performed will be described. The conventional replacement table manages the replacement source and replacement destination of the defective sector. In the present invention, a slip replacement occurs in the user data area 103a when the rearrangement is performed. Therefore, this sector is registered in the slip management table and processing is performed as in the related art.

The above-described tables and flags are written in a non-volatile storage medium in consideration of the fact that the power is cut off during the rearrangement.

Next, a case will be described in which the rotary storage device according to the present embodiment receives another command during execution of the rearrangement process. The determination as to whether or not the rearrangement is being performed refers to the rearrangement processing flag.

As an example, in the spare area n-0 in the state of FIG. 5, the data of D00 in the group management table 1 is replaced with R0.
Assume that another command has been received when writing to 3. The replacement management table 200, the rearrangement group management table 300, and the sector arrangement state on the medium at this time are shown in FIGS. 13, 14, and 15, respectively. Here, for a command that does not access the medium or a command that does not access the rearrangement area, the rearrangement processing in progress flag is set as shown in FIG. With reference to the sorting group management table 300, the sorting process is executed again. If the power supply can be shut down during the rearrangement, the read data may be evacuated to an empty area such as the management area 101 or 103 after steps # 17 and # 19 in FIG. Step # 17a,
And step # 19a). This flag is referred to when the power of the rotary storage device is turned on, and the rearrangement process is subsequently executed again.

Next, a method of obtaining a sector position when a command for accessing a sector in the rearrangement area is received during the rearrangement process will be described. FIG. 16 is a flowchart illustrating an example of the processing.

In step # 60, it is determined from the rearranged group management table 300 whether the sector to be accessed is a rearranged uncompleted group. If so, the process proceeds to step # 64 to execute the normal access process.

In step # 61, it is determined whether or not the sector to be accessed from the rearrangement group management table 300 is a rearrangement executing group. If so, proceed to step # 62.

In step # 62, the rearranged completion start logical block address 305 and the rearranged completed last logical block address 3 in the rearrangement group management table 300
06, it is determined whether or not the rearrangement is completed. If so, the process proceeds to # 63.

In step # 63, since the sectors to be accessed have been rearranged, a rearrangement position calculation process is performed to determine the positions of the sectors to be accessed. This is done by referring to the rearrangement group management table 300 and adding the rearrangement completed sector count from the rearrangement start sector position (the position of R03 in FIG. 2 in the case of FIG. 15). (Including the number).

As described above, according to the rotary storage device of the present embodiment, each of the plurality of notches 103 (notches 0 to n) set in the rotary storage medium 100 is arranged at the center. A user data area 103a, two replacement areas 103b (n-0) and a replacement area 103c (n-1) disposed before and after the user data area 103a. Occurs, a replacement sector in the replacement area 103b or 103c closer to the occurrence position is allocated, and the user data area 103 is generated at a desired opportunity.
The user data sector and the spare sector in the spare area 103b or 103c are rearranged as described above, so that the seek time and the rotation waiting time can be obtained when accessing the notch 103 where a defective sector has occurred as in the related art. No increase in the time required for access such as read or write to the notch 103 including the defective sector is suppressed, and the access performance can be improved.

The user data sector and the replacement area 103b or 103 in the user data area 103a
By rearranging the replacement sectors in the user data sector 103a and the replacement area 1 in the user data area 103a.
Since the arrangement of the replacement sectors in 03b or 103c is optimized, for example, there is no data loss such as a medium format, and therefore, the access performance by optimizing the allocation of the replacement area accompanying the replacement processing without losing the user data. Can be improved.

Whether or not the present invention is implemented in an arbitrary rotary storage device can be verified by performing the following operation as an example.

That is, according to the SCSI standard widely used as a connection interface for small peripheral devices in a computer system, a host device notifies a peripheral device such as a rotary storage device of media defect information to notify a peripheral device of a defective sector of a defective sector. "REASSI" for defect processing
There is a "GN BLOCK" command.

Therefore, the host device instructs the rotary storage device to perform the replacement process forcibly (intentionally) by utilizing this, and the access requirement before and after the intentionally performed replacement process is determined. The above-described verification operation can be performed by measuring a change in time.

That is, first, any desired notch 10
A plurality of data sectors in the 3 (n) user data area 103a are sequentially accessed to measure a first required time t1 (first step).

Next, "REASSIGN BLO" in which the logical block address of the target sector is designated from the host device.
The "CK" command is used so that the order of the logical block addresses is reversed for a plurality of sectors having discontinuous logical block addresses in the user data area 103a to be accessed as described above (in this manner, the skipped logical blocks are skipped). By performing the replacement process on the sector of the address, the technology of rearranging the replacement sectors having the continuous logical block addresses in the replacement area as in the technology of JP-A-9-35418 becomes invalid. Perform the replacement process (second
Steps).

Further, immediately after the second step described above,
The same access range as the first step (notch 10
3) the sequential access is performed and the second required time t
2 is measured (third step).

Further, at an arbitrary opportunity after the third step, the same access range (notch 10) as in the first step is used.
A sequential access to 3) is executed to obtain a third required time t.
3 is measured (fourth step).

Then, the measurement results of t1 to t3 are compared, and
If it is confirmed that the magnitude relationship between t1, t2, and t3 is such that the second required time t2> the third required time t3 ≧ the first required time t1, the rotary storage device implements the present invention. Can be regarded as doing.

The reason is that after the access performance is reduced by the intentional replacement process from the initial state (t1) (t2> t
1), the access performance is restored to the initial state by implementing the sorting technique of the present invention executed at a predetermined timing (t3)
≧ t1).

The invention made by the present inventor has been specifically described based on the embodiments. However, the present invention is not limited to the above-described embodiments, and various modifications can be made without departing from the gist of the invention. Needless to say, there is.

[0082]

According to the rotary storage device of the present invention, it is possible to improve the access performance by suppressing an increase in the required access time due to the replacement process.

Further, there is an effect that the access performance can be improved by optimizing the allocation of the replacement area in the replacement processing without losing the user data.

[Brief description of the drawings]

FIG. 1 is a conceptual diagram showing an example of an operation of a rotary storage device according to an embodiment of the present invention.

FIG. 2 is a conceptual diagram showing an example of a configuration of a notch which is a user data area set on a rotary storage medium in a rotary storage device according to an embodiment of the present invention.

FIG. 3 is a conceptual diagram showing an example of a configuration of a rotary storage medium in a rotary storage device according to an embodiment of the present invention.

FIG. 4 is a conceptual diagram illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 5 is a conceptual diagram illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 6 is a conceptual diagram showing an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 7 is a flowchart illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 8 is a conceptual diagram illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 9 is a conceptual diagram illustrating an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 10 is a conceptual diagram showing an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 11 is a conceptual diagram showing an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 12 is a conceptual diagram illustrating an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 13 is a conceptual diagram illustrating an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 14 is a conceptual diagram showing an example of information used in a rotary storage device according to an embodiment of the present invention.

FIG. 15 is a conceptual diagram illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 16 is a flowchart illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 17 is a conceptual diagram illustrating an example of an operation of the rotary storage device according to the embodiment of the present invention;

FIG. 18 is a conceptual diagram showing a sector arrangement when a defective sector occurs in a certain sector on a medium in the reference technology of the present invention.

FIG. 19 is a conceptual diagram illustrating a case where a certain sector on a medium becomes a defective sector and a replacement process occurs in the reference technology of the present invention.

FIG. 20 is a conceptual diagram showing a configuration of a notch on a medium according to the reference technology of the present invention.

FIG. 21 is a conceptual diagram showing an example of the operation of the reference technology of the present invention.

[Explanation of symbols]

100: rotating storage medium, 101, 102: management area,
103: Notch, 103a: User data area, 103
b: replacement area (first replacement area); 103c: replacement area (second replacement area); 200: replacement management table;
0, 300a, 300b ... rearranged group management table, 301 ... group number, 302 ... top logical block address, 303 ... last logical block address, 304
... Number of group sectors, 305... Top logical block address of rearrangement completion, 306... Last logical block address of rearrangement completion, 307.

Claims (3)

[Claims] 1. A plurality of unit areas of a rotary storage medium are divided into a user data area and a spare area, and when a defect occurs in the unit area in the user data area during operation, a defect of the unit area is determined. A rotary storage device having a replacement processing function for allocating the unit area of the replacement area instead, wherein the replacement area includes a first replacement area arranged in front of the user data area, and a user data area. A second replacement area disposed behind the area, wherein the replacement processing function is as far as possible with respect to the unit area of the defect in the first or second replacement area on the side closer to the unit area of the defect. A first function of allocating the unit area, at any occasion, the unit area in the user data area and the unit area in the first and second replacement areas used in the replacement processing; Rotary type storage device the location, and further comprising a sequential access direction physically continuously sort second function, at least one of the functions. 2. The rotary storage device according to claim 1, wherein in the second function, when one of the first and second replacement areas is completely used for rearranging, the defect is not detected. Operation of using the other second or first replacement area irrespective of the position of the unit area, the unit area in the user data area and the first and second replacement areas used in the replacement processing The operation of rearranging the arrangement of the unit areas at power-on, and the arrangement of the unit areas in the first and second replacement areas used in the replacement processing with the unit areas in the user data area. An operation of performing the rearrangement in a vacant time period when there is no access from a higher-level device; and an operation of the unit area in the user data area and the unit area in the first and second replacement areas used in the replacement processing. Arrangement Base instead of having a command interface to command from the host device, the operation of executing the rearrangement in response to a command from a host device, rotating type storage device which is characterized in that at least one operation. 3. A plurality of unit areas of the rotary storage medium are divided into a user data area and a spare area, and when a defect occurs in the unit area in the user data area during operation, a defect of the unit area is determined. A rotary storage device having a replacement processing function for allocating the unit area of the replacement area instead, and sequentially accessing a plurality of the unit areas in the user data area to measure a first required time A first step of performing; a second step of intentionally performing a replacement process on the plurality of unit areas in which the logical block addresses in the user data area are discontinuous; and immediately after the second step. A third step of executing a sequential access to the same access range as the first step to measure a second required time, and an optional step after the third step Executing a sequential access to the same access range as the first step to measure a third required time, and executing the first, second, and third required times. 2. The rotary storage device according to claim 1, wherein the magnitude relation is such that a second required time> a third required time ≧ a first required time.