CN105913857A - Magnetic disk drive and rewrite processing method - Google Patents
Magnetic disk drive and rewrite processing method Download PDFInfo
- Publication number
- CN105913857A CN105913857A CN201510487466.3A CN201510487466A CN105913857A CN 105913857 A CN105913857 A CN 105913857A CN 201510487466 A CN201510487466 A CN 201510487466A CN 105913857 A CN105913857 A CN 105913857A
- Authority
- CN
- China
- Prior art keywords
- mentioned
- time
- write
- tracks
- groups
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000003672 processing method Methods 0.000 title claims description 5
- 238000000034 method Methods 0.000 claims description 45
- 230000015654 memory Effects 0.000 description 130
- 238000013523 data management Methods 0.000 description 48
- 238000003860 storage Methods 0.000 description 25
- 238000007726 management method Methods 0.000 description 20
- 238000010586 diagram Methods 0.000 description 13
- 238000004364 calculation method Methods 0.000 description 8
- 238000000151 deposition Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 4
- 241001269238 Data Species 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 101100009524 Anas platyrhynchos HSD17B12 gene Proteins 0.000 description 1
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 101100256975 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) SIP2 gene Proteins 0.000 description 1
- 101100203850 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) SPT2 gene Proteins 0.000 description 1
- 101100291461 Schizosaccharomyces pombe (strain 972 / ATCC 24843) spm2 gene Proteins 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000000280 densification Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
- G11B27/36—Monitoring, i.e. supervising the progress of recording or reproducing
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B5/00—Recording by magnetisation or demagnetisation of a record carrier; Reproducing by magnetic means; Record carriers therefor
- G11B5/012—Recording on, or reproducing or erasing from, magnetic disks
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B19/00—Driving, starting, stopping record carriers not specifically of filamentary or web form, or of supports therefor; Control thereof; Control of operating function ; Driving both disc and head
- G11B19/02—Control of operating function, e.g. switching from recording to reproducing
- G11B19/04—Arrangements for preventing, inhibiting, or warning against double recording on the same blank or against other recording or reproducing malfunctions
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B19/00—Driving, starting, stopping record carriers not specifically of filamentary or web form, or of supports therefor; Control thereof; Control of operating function ; Driving both disc and head
- G11B19/02—Control of operating function, e.g. switching from recording to reproducing
- G11B19/04—Arrangements for preventing, inhibiting, or warning against double recording on the same blank or against other recording or reproducing malfunctions
- G11B19/041—Detection or prevention of read or write errors
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
- G11B20/1816—Testing
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
- G11B2020/1869—Preventing ageing phenomena from causing data loss, e.g. by monitoring the age of record carriers or by recognising wear, and by copying information elsewhere when a record carrier becomes unreliable
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B5/00—Recording by magnetisation or demagnetisation of a record carrier; Reproducing by magnetic means; Record carriers therefor
- G11B5/02—Recording, reproducing, or erasing methods; Read, write or erase circuits therefor
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B5/00—Recording by magnetisation or demagnetisation of a record carrier; Reproducing by magnetic means; Record carriers therefor
- G11B5/02—Recording, reproducing, or erasing methods; Read, write or erase circuits therefor
- G11B5/09—Digital recording
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Digital Magnetic Recording (AREA)
- Recording Or Reproducing By Magnetic Means (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
According to one embodiment, a magnetic disk drive including a disk including a plurality of track groups each including a first write track and a second write track partially overlapping the first write track, and a processor configured to count a write count corresponding to write processing of adjacent track groups for each of the plurality of track groups, and calculate an estimated time at which the write count reaches a particular value and, if a track group in which the estimated time is approximate is detected, read data of the approximate track group, and execute rewrite processing of writing the data to the track group in which the estimated time is approximate, at a time earlier than the estimated time.
Description
Related application
The application enjoys with Japanese patent application 2015-34910 (applying date: on February 25th, 2015)
Based on application priority.The application applies for by referring to this basis, comprises the whole of basis application
Content.
Technical field
Embodiments of the present invention relate to dish device and rewrite processing method.
Background technology
In recent years, be developed for realize as tape deck an example disk set (hereinafter also referred to as
The various technology of high recording capacity HDD).As one of these technology, have referred to as
The record of " SMR (shingled write magnetic recording) (or stacked tile type recording mode) "
Technology.Stacked tile type recording mode is when to disk write data, to the magnetic track adjacent with recording track
The mode of the overlapping record of a part.By using this stacked tile type recording mode, it is possible to increase magnetic track is close
Degree (Track Per Inch:TPI, per inch magnetic track).
Make disk set can pass through stacked tile type record work efficiently to disk it addition, propose issue
The magnetic of (Host aware/managed) type is known/managed to the main frame of written request signal making to carry out writing
Dish device.
If the record unit in stacked tile type recording mode is i.e. comprised the groups of tracks of multiple magnetic track (also referred to as
Memory bank (band)) write, then the data preserved at adjacent memory bank can be by by being referred to as
The impact that the magnetic disturbance of ATI (interference of Adjacent Track Interference: adjacent track) produces.
Therefore, if the predetermined memory bank on dish is repetitively written, then due to adjacent memory bank data repeatedly
By magnetic disturbance, it is possible to (loss) cannot be read.Main frame know/disk set of management type in,
Likely predetermined memory bank is repetitively written data.
In order to prevent such situation (data degradation) that cannot read data, carry in disk set
There is the function that storage intra-body data is independently written over (Refresh Data)./ management type is known at main frame
Disk set in, it is possible to once multiple memory banks are carried out Refresh Data.Thus, disk set
The response performance of the request from main frame is likely to decrease.
Summary of the invention
Embodiments of the present invention provide the magnetic that the response performance to the request from main frame can be made stable
Dish device and rewriting processing method.
Disk set involved by present embodiment possesses: dish, and it has multiple groups of tracks, the plurality of
Groups of tracks comprises the 1st write magnetic track and the 2nd write magnetic track overlapping with the 1st write track portion respectively；
And process portion, it is each by multiple groups of tracks, processes phase to the write to adjacent groups of tracks
The write number of times answered counts, and computing write number of times reaches the predicted time of predetermined value, in inspection
In the case of measuring the groups of tracks of predicted time approximation of institute's computing, read the magnetic track of predicted time approximation
The record data of group, perform to be written to the record data of reading in the time more Zao than predicted time afterwards
The rewriting of the groups of tracks of approximation processes.
Accompanying drawing explanation
Fig. 1 is the block diagram of the major part of the disk set representing the 1st embodiment.
Fig. 2 is for the stacked tile type writing task used in the disk set of the 1st embodiment is described
Figure.
Fig. 3 is the figure of an example of the system information representing the 1st embodiment.
Fig. 4 is the schematic diagram of the concept of the predicted time for the 1st embodiment is described.
Fig. 5 (a) is the figure of an example of the timing diagram representing Refresh Data, and Fig. 5 (b) is to represent Refresh Data
The figure of another example of timing diagram.
Fig. 6 is the flow chart of an example of the process of the disk set representing the 1st embodiment.
Fig. 7 is the figure of an example of the system information of the variation representing the 1st embodiment.
Detailed description of the invention
Hereinafter, with reference to the accompanying drawings of embodiment.
[the 1st embodiment]
Fig. 1 is the block diagram of the major part representing the disk set 200 involved by present embodiment.
The disk set 200 of present embodiment is with stacked tile type recording mode (shingled write
Magnetic recording, also referred to as SMR) main frame of record data knows the/HDD of management type.?
In the disk set of this stacked tile type recording mode, disk (dish) upper formed multiple groups of tracks (memory bank:
band).Memory bank includes multiple magnetic track (or write magnetic track: write track).In memory bank, with many
The individual magnetic track part mode overlapping with other magnetic tracks respectively writes, but finally carry out writing
Magnetic track is not write by overlap.The disk set of stacked tile type recording mode is pressed every with memory bank for record unit
Individual bank sequence ground writes data to dish.
Disk set 200 possesses: head discs assembly described later (head-disk assembly:HDA)；Drive
Dynamic device IC20；Head amplifier integrated circuit (hereinafter referred to as head amplifier IC) 30；Volatile storage
Device 70；Nonvolatile memory 80；Buffer storage 90；Including single-chip integrated circuit be
System controller 130.
It addition, disk set 200 is connected with host computer system (main frame) 150./ management type is known with main frame
Disk set 200 connect host computer system 150 preserve with the data of disk set 200 composition relevant
Information, the information of size of the most single memory bank.This host computer system 150 is by managing each storage
The LBA (Logical Block Address: LBA) of the beginning of body, it is possible to output makes disk
Device 200 easily performs the writing commands of write to each memory bank.
The structure of the disk set 200 of following description present embodiment.
HDA possess disk (hereinafter referred to as dish) 1, rotating shaft motor (SPM) 2, carry head 10 arm 3,
Voice coil motor (VCM) 4.Dish 1 is rotated by rotating shaft motor 2.Arm 3 and VCM4 constitutes actuator.
The actuator driving by VCM4, moves control to dish 1 by the head 10 carried at arm 3
Specify position.Dish 1 and head 10 arrange more than one quantity.
Dish 1 possesses (stacked tile type recording areas, region, media buffer (media cache) region 100 and SMR
Territory) 110, as data storage areas.Media buffer region 100 is stacked tile type posting field 110
Caching.
The storage region that e.g. the most peripheral side on dish 1 guarantees, media buffer region 100, be by
Low track density (the Track Per commonly writing work write data of non-stacked tile type record
Inch:TPI, per inch magnetic track) data recording area.Media buffer region 100 possesses system information
101.System information 101 comprises relevant to stacked tile type posting field 110, depositing of being written into/read
The time starteds of the position in storage area territory, write/read number of times and/or Refresh Data (rewriting process) etc. believe
Breath.Here, Refresh Data is temporarily to read the data that have recorded at predetermined posting field and write together
The rewriting in one storage region processes.In the present embodiment, for convenience of description, Refresh Data represents
Temporarily read the data that have recorded at predetermined memory bank the process writing same bank.About being
The details of system information 101, after describe.It addition, system information 101 can also be recorded in matchmaker
Other memories beyond body buffer zone 100 and/or storage medium.
Stacked tile type posting field 110 be by with adjacent track a part of overlapping in the way of write data
The posting field of high track density.Stacked tile type posting field 110 possesses multiple memory bank, the plurality of deposits
Storage body comprises at least one the 1st magnetic track of write overlapping with an adjacent track part and last overlap respectively
2nd magnetic track of write.The track width of the 2nd magnetic track is than the 1st track width.At stacked tile type posting field
110, record user data etc..
Head 10, based on slide block, has write head 10W and the playback head being arranged on this slide block
10R.Playback head 10R reads the data of the track recording on dish 1.Write head 10W is on dish 1
Write data.
Driver IC 20 controls the driving of SPM2 and VCM4.
Head amplifier IC30 has sense amplifier and write driver.Sense amplifier amplifies by reading
The read output signal that the 10R that lifts one's head reads, and transmit to reading/write (R/W) passage 40.On the other hand,
Write driver will be sent to write with the corresponding reset current of write data exported from R/W passage 40
Enter a 10W.
If volatile memory 70 is power supply, supply is cut off, the semiconductor that the data preserved will be lost
Memory.Number required in the process of each several part that volatile memory 70 is stored in disk set 200
According to etc..Volatile memory 70 e.g. RAM (Random Access Memory, arbitrary access
Memory) etc..
Partly leading of the data that even if nonvolatile memory 80 is power supply supply cut-out also to be preserved
Body memory.Nonvolatile memory 80 is such as flash ROM (Read Only Memory: only
Read memory), MRAM (Magneto resistive Random Access: magnetic-resistance random access store
Device) etc..
Buffer storage 90 is the semiconductor memory that temporarily storage sends the data received.Buffering is deposited
Reservoir 90 is stored in the data etc. sending reception between dish 1 and host computer system 150.It addition, buffering is deposited
Reservoir 90 can also be integrally formed with volatile memory 70.
System controller 130 comprises R/W passage 40, hard disk controller (HDC) 50, microprocessor
(MPU (process portion)) 60.
R/W passage 40 performs to read data and the signal transacting of write data.
HDC50 controls the data transmission between host computer system 150 and R/W passage 40.HDC50 has
Standby dish control portion 51, host computer control portion 52, order control portion 53, cushioning control portion 54.These portions
Divide and connect via bus etc. in HDC50 respectively.
Dish control portion 51 is connected with R/W passage 40, carries out the control of dish 1.
Host computer control portion 52 carries out the control that the data between host computer system 150 and R/W passage 40 transmit
System.
Order control portion 53 carries out relevant to writing commands or the read-out command received from host computer system 150
Control.
Cushioning control portion 54 is connected with buffer storage 90, controls the data to buffer storage 90 and sends out
Send reception.Cushioning control portion 54 is by the data such as read from dish 1, the data etc. to write dish 1
It is temporarily stored in buffer storage 90.
MPU60 is the master controller of each several part controlling disk set 200.MPU60 is via driving
Device IC20 controls VCM4, performs SERVO CONTROL, and this SERVO CONTROL carries out the location of head 10.Enter
And, MPU60 performs the control of the write work of the data to dish 1, and performs to select from main frame system
The control preserving destination of the write data of system 150 transmission.Here, in control based on MPU60
In the write work carried out, comprise the work of stacked tile type recording mode.
Fig. 2 is the stacked tile type record work used in the disk set 200 of present embodiment for explanation
The figure made.Fig. 2 is a figure part for dish 1 being exaggerated.In fig. 2, as an example, storage
Body comprises 4 magnetic tracks (Track0, Track1, Track2 and Track3) respectively.It addition, memory bank
In the quantity of magnetic track that comprises be not limited to 4.
In disk set 200, by being write data on dish 1 by write head 10W, on dish 1
Radial direction constitute magnetic track (data track).In stacked tile type recording mode, the overlapping write in each track order ground
To stacked tile type posting field 110.In fig. 2, write head 10W presses track number in each memory bank
0,1,2,3 (Track0, Track1, Track2, Track3) be sequentially written in data.At these
Between memory bank, in order to prevent the overriding etc. of data, it is configured with protection zone (or gap (Gap)).From
And, the magnetic track overlap that the Track0 of each memory bank～the one side of 2 are then written to writes, thus data letter
Number width attenuates.On the other hand, the Track3 of each memory bank is not owing to being write by overlap, so keeping
The data-signal width wider than Track0～2.
If be by such order rewrite stacked tile type recording mode, then due to can by each magnetic track that
This spaced design obtains narrow, it is possible to realize the densification of the data track constituted on dish 1.
Return Fig. 1, MPU60 and possess write management through figures portion 62, predicted time calculating part 64, number
According to refreshing management department 66.MPU60 reference system information 101, controls these modules respectively.It addition,
The process of write management through figures portion 62, predicted time calculating part 64 and Refresh Data management department 66 is solid
Perform on part.
First, the system information 101 of present embodiment it is described with reference to.
Fig. 3 is the figure of an example of the system information representing present embodiment.
In the present embodiment, system information 101 comprise predicted time table G1, Refresh Data initial
Time started Td0, the time started Td of Refresh Data, Refresh Data time m, current time Tn.
Predicted time table G1 is threshold value (Refresh Data threshold value) K, the expression comprising write number of times described later
Number of times (the execution that write processes to the memory bank write adjacent with the both sides of the memory bank as object
Number of times) write number of times (k', k), represent the writing of time that the memory bank adjacent with both sides is performed write
The table of the angle of incidence (t', t) and predicted time T etc..Here, t is against current time (described later currently
Time Tn) before, write time of write of such as performing a when time before writing number of times and being, k be
The write number of times of time t, when t' is the write of the write once performed before the write that time t performs
Between, k' is the write number of times at time t'.It addition, predicted time is the time that start Refresh Data.
Predicted time is predicted based on threshold k, write number of times (k', k) and/or write time (t', t) and updates.
The threshold k of write number of times is that the memory bank as object is performed the write number of times needed for Refresh Data.
Threshold k can be both same value to whole memory banks, it is also possible to is set as by each memory bank different
Value.
Initial starting time (hereinafter referred to as initial starting time) Td0 of Refresh Data is to start data brush
The initial value of the new scheduled time.Initial starting time Td0 by after dispatching from the factory from disk set 200 by with
The cumulative time that the time of family initial start-up starts at is (during the accumulation hereinafter referred to as started at when initial start
Between) represent.Initial starting time Td0 was preset in the fabrication stage etc..Initial starting time Td0
It is same value to storage region such as all memory banks, is set to the life-span relative to disk set 200
The numerical value that time is much bigger.
Time started (hereinafter referred to as time started) Td of Refresh Data be away from current time (described later work as
Front time Tn) scheduled time of starting of the nearest Refresh Data that should perform.Time started Td by from
The accumulated time started at during initial start represents.Time started Td according to current time (described later current time
Between Tn) under the predicted time T of predicted time table G1 estimate.Thus, time started Td is in prediction
Time T is updated when updating every time.In the case of not calculating predicted time T, it is set as the time started
Td=Td0.Such as, as not calculating the situation of predicted time T, enumerate after just initial start
And/or just performed after Refresh Data etc..
Refresh Data time m is the time started single memory bank to completing from Refresh Data
(required time).In the present embodiment, Refresh Data time m is the most identical at whole memory banks.It addition,
Refresh Data time m can also be set by each memory bank.
Current time Tn is the accumulated time started at when initial start.For convenience of description, below,
Chronomere is set to the second.It addition, chronomere can also be hour or minute etc., it is also possible to be by magnetic
The arbitrary value that dish device 200 sets.
Then, return Fig. 1, the write management through figures portion 62 of MPU60, predicted time calculating part are described
64 and Refresh Data management department 66.
Write number of times on write management through figures portion 62 management dish 1.In the present embodiment, write meter
Number management department 62 is to any one storage of the memory bank adjacent with the both sides of the memory bank as object
The write number of times of body counts, and when the most adjacent memory bank is written into, updates system information
The write number of times of 101.Such as, in the predicted time table G1 of Fig. 3, memory bank 1 is being written with
In the case of data, write management through figures portion 62 makes the write number of times k of memory bank 0 and memory bank 2 increase
Add (being incremented by), and be updated to memory bank 1 is write by the write time t of memory bank 0 and memory bank 2
Time current time Tn inscribed entered.Now, the memory bank 0 before write management through figures portion 62 will update
Memory bank and the write number of times k of memory bank 2 is set to the write number of times k' before it, before updating
0 and the write time t of memory bank 2 is set to the write time t' before it.Reach at write number of times k
Threshold k and in the case of performing Refresh Data, write management through figures portion 62 is by (pre-for system information 101
Survey timetable G1) write number of times k be updated to the value less than current value, such as 0.But, it was predicted that
The write time t of timetable G1 maintains.
Predicted time calculating part 64 calculates the memory bank predicted time T as object.Predicted time calculates
Portion 64 records result of calculation to system information 101 (predicted time table G1).Predicted time calculating part 64
The near linear derived with reference to the increment rate according to write number of times and the time interval of write time, calculates
Predicted time.It addition, rank can be being manufactured in advance as program for calculating the formula of predicted time
Section sets, it is also possible to be the composition that can at random set of user.Such as, data are performed just
After refreshing, it was predicted that the predicted time T of predicted time table G1 is set to initially by Time Calculation portion 64
Time started Td0.
Fig. 4 is the schematic diagram of the concept of the predicted time for present embodiment is described.
When Fig. 4 is to represent the prediction repeatedly performed an identical memory bank in the case of Refresh Data
Between the figure of concept.In the diagram, it was predicted that time T (1) is carried out the predetermined of initial Refresh Data
Predicted time T, it was predicted that time T (2) is the predetermined of the 2nd execution Refresh Data after predicted time T (1)
Predicted time T.It addition, in the diagram, initial starting time Td0 is set to when initial start (t=0)
The far time.In the diagram, reference marks Td represents the aforesaid time started.
Below, it is shown that with reference to the scope (0 < t≤T (1)) when initial start to T till (1) shown in Fig. 4
And derive an example of the method for predicted time T.
As shown in Figure 4, it was predicted that Time Calculation portion 64 with reference to according to write number of times (k, k') increment rate with
The following formula that the time interval of write time (t, t') derives, calculates predicted time T.
T=t+ (K k)/(k k') × (t t') ... formula (1)
Calculate predicted time T if being located at when adjacent memory bank being write every time, then due to
K-k'=1, so predicted time calculating part 64 can calculate predicted time T according to following formula.
T=t+ (K k) × (t t') ... formula (2)
In the present embodiment, it was predicted that Time Calculation portion 64 is according to the write number of times of predicted time table G1
(k and k') and write time (t and t') are updated this situation, use aforesaid formula (2) to calculate predicted time
T, and update the predicted time T of predicted time table G1.Here, it was predicted that Time Calculation portion 64 is initially
When during startup, (t=0) and Refresh Data perform (T (1), T (2)), it is not necessary to when calculating prediction by aforesaid formula (2)
Between T, but initial starting time Td0 is set as predicted time T.
In the diagram, after initial Refresh Data performs with predicted time T (1), it was predicted that Time Calculation
Portion 64 calculates the predicted time T (2) that the 2nd secondary data refreshes.Now, it was predicted that Time Calculation portion 64 exists
Period (T (1) < t≤T (2)) from predicted time T (1) to predicted time T (2), with initial data
Refresh same, use formula (2) to derive predicted time T (2).It addition, when initial start to predicted time
Time till T (1) with perform from initial Refresh Data after (predicted time T (1)) to predicted time T (2)
Till time the most identical.
It addition, in the diagram, for convenience of description, describe when initial start to predicted time T (1)
Till, write number of times k increases at a certain time interval (point-blank), but, until predicted time
Period till T (1), the increment rate of write number of times k can change.I.e., in the diagram, write number of times
The slope of k is likely changed by each time t.In this case, such as, Fig. 4 from
Period to predicted time T (1) during initial start, threshold k and time (such as, write time t)
Relation without straight line but represent with broken line.
Alternatively, it is also possible to be configured to: predicted time calculating part 64, in the case of write number of times is few, is sentenced
Break low for the precision of predicted time T, carry out the process making calculated predicted time T extend.Writing
In the case of indegree is few, actually reaching at write number of times can between the time of threshold value and predicted time T
Error can be produced.Thus, it was predicted that Time Calculation portion 64 is low by the precision being judged as predicted time T,
This error can be alleviated.
Refresh Data on Refresh Data management department 66 management dish 1.Refresh Data management department 66 reference
System information 101, the posting field on dish 1 searches the region needing Refresh Data termly, and
When the posting field needing Refresh Data being detected, this storage region is performed Refresh Data.
Refresh Data management department 66 has reached data brush at the write number of times predetermined memory bank being detected
The new situation of threshold value, current time Tn have reached the time started Td of the Refresh Data of predetermined memory bank
Situation or current time Tn reached in the case of the predicted time T of predetermined memory bank arbitrary
During situation, predetermined memory bank is performed Refresh Data.It addition, Refresh Data management department 66 is in data
Refresh after just performing, reset the time started Td of Refresh Data, be set to initial starting time
Td0。
It addition, Refresh Data management department 66 is in the feelings multiple memory banks close for predicted time T being detected
Under condition, set the order performing Refresh Data according to the predicted time T of these memory banks, and according to institute
The order set, performs Refresh Data successively.In this case, Refresh Data management department 66 contrasts pre-
Survey time T is early and the close multiple memory banks (memory bank group) of predicted time T start Refresh Data, and with
Impartial time interval performs these Refresh Datas.
Hereinafter, with reference to the accompanying drawings of the multiple memory banks close to predicted time Refresh Data process
One example.
Refresh Data management department 66 in the case of the close multiple memory banks of predicted time T being detected,
Judge that the time interval of each predicted time T is less than Refresh Data time m.Each predicted time T's
In the case of time interval is less than Refresh Data time m, Refresh Data management department 66 will compare Refresh Data
Multiple predicted time T little for time m are judged as " predicted time approximation ".It addition, at each predicted time
In the case of the time interval of T is little unlike Refresh Data time m, Refresh Data management department 66 will be unlike
Multiple predicted time T little for Refresh Data time m are judged as " predicted time separation ".
Such as, if the Refresh Data time m that the system information of Fig. 3 101 is comprised is 2 seconds.It addition,
If current time Tn is close to the predicted time T (7208 (second)) of memory bank 2.Here, to memory bank
In the case of 2 perform Refresh Data, when Refresh Data management department 66 is judged as the prediction with memory bank 2
Between the difference of T (7208 (second)) be in the memory bank 1 in the range of 2 seconds of Refresh Data time m and storage
The predicted time T (7210 (second)) of body 4 is close.And then, Refresh Data management department 66 is judged as and storage
The difference of the predicted time T (7210 (second)) of body 1 and memory bank 4 is in the model of Refresh Data time m (2 seconds)
The predicted time T (7211 (second)) enclosing interior memory bank 0 is close.Refresh Data management department 66 is so detected
The memory bank that predicted time T is close, until inspection does not measures predicted time T and is in Refresh Data time m's
In the range of memory bank till.
If Refresh Data management department 66 terminates the detection of memory bank close for predicted time T, then set and hold
The order of row Refresh Data.Now, Refresh Data management department 66 is set as depositing from predicted time T morning
Storage body starts preferentially to perform Refresh Data.
For example, referring to the predicted time table G1 of Fig. 3, Refresh Data management department 66 is set as judgement
For memory bank group (memory bank 0, memory bank 1, memory bank 2 and memory bank 4) close for predicted time T
Middle predicted time T memory bank 2 the earliest preferentially performs Refresh Data.In the feelings that predicted time T-phase is same
Under condition, Refresh Data management department 66 is set as opening from the memory bank big for write number of times k before it
Begin preferentially to perform Refresh Data.In figure 3, the predicted time T-phase of memory bank 1 and memory bank 4
With, the write number of times k before it of memory bank 1 is bigger than memory bank 4.In this case, data
Refresh management department 66 to be set as, compared to memory bank 4, memory bank 1 preferentially being performed Refresh Data.
Then, during Refresh Data management department 66 is set as the memory bank group close to predicted time, predicted time is
Slow memory bank 0 finally performs Refresh Data.
After setting the order performing Refresh Data, Refresh Data management department 66 setting data refreshes
Execution timing and time interval.Refresh Data management department 66 is according to current time Tn, multiple storage
Quantity n of body and data refresh time m, calculate and perform the whole of the close memory bank group of predicted time
Time needed for Refresh Data.
Refresh Data management department 66 finally performs in calculating the memory bank group of roughly the same predicted time
Total ascent time (m × (n-1)) needed for Refresh Data beyond the memory bank of Refresh Data and when current
Between time difference Tn to predicted time (final predicted time) Te of the last Refresh Data performed
(Te-Tn)。
The Refresh Data management department 66 total ascent time (m × (n-1)) to being calculated and time difference (Te-Tn)
Compare, perform Refresh Data, until the time difference (Te-Tn) is bigger than the total ascent time (m × (n-1))
Till time Tn.
The several examples performing timing of Refresh Data described below.
Fig. 5 (a) and (b) are the figures of an example of the timing diagram representing Refresh Data.In Fig. 5 (a) and (b),
D1, D2, D3 and D4 represent Refresh Data respectively.Such as, D1 represents the data brush of memory bank 2
Newly, D2 represents the Refresh Data of memory bank 1, and D3 represents the Refresh Data of memory bank 4, and D4 represents
The Refresh Data of memory bank 0.It addition, in Fig. 5 (a) and (b), reference marks Td1 and Td2 are respectively
Represent the scheduled time started away from the nearest Refresh Data that should perform of current time.In other words, ginseng
Represent according to symbol Td1 and Td2 and initially to hold in the case of having the close multiple memory banks of predicted time
The time started of the Refresh Data of row.In Fig. 5 (a), Δ T1 represents the data brush of each memory bank respectively
Time interval between Xin.
In the example shown in Fig. 5 (a), Refresh Data management department 66 is with the Refresh Data at each memory bank
Between the mode of predetermined time interval Δ T1 be set perform.Time interval Δ T1 is contained in system letter
Breath 101.It addition, time interval Δ T1 can preset, it is also possible to from disk set 200
Portion at random sets.Refresh Data management department 66 reference system information 101, according to following formula meter
Calculate the Refresh Data time started.
Td1=(Te (n 1) × (m+ Δ T1)) ... formula (3)
Refresh Data management department 66 when current time Tn has reached Refresh Data time started Td1 by
According to the order set, perform Refresh Data.That is, set interval between Refresh Data Δ T1.
As shown in Fig. 5 (a), performing in the case of 4 Refresh Datas, the Refresh Data time started by
Td1=(Te 3 (m+ Δ T1)) represents.In this case, Refresh Data management department 66 is counting
Refresh Data D1 is started, after the end of Refresh Data D1, when separating according to refreshing time started Td1
Between interval delta T 1 and perform next Refresh Data D2.Equally, Refresh Data management department 66 is at data brush
Separate time interval Δ T1 after the end of new D2 and perform Refresh Data D3, at the knot of Refresh Data D3
Separate time interval Δ T1 after bundle and finally perform Refresh Data D4.So, Refresh Data management department
66 can perform Refresh Data equably on the time.
In the example shown in Fig. 5 (b), Refresh Data management department 66 reference system information 101, according to
Following formula calculates Refresh Data time started Td2.
Td2=(Te (n 1) × m) ... formula (4)
Refresh Data management department 66 when current time Tn has reached Refresh Data time started Td1 by
According to the order set, each memory bank is performed Refresh Data.In Fig. 5 (b), Refresh Data manages
Portion 66, when current time Tn has reached Refresh Data time started Td2, starts Refresh Data D1,
Perform Refresh Data D2 and D3 the most successively.Finally, Refresh Data management department 66 is when as prediction
Between final predicted time Te start Refresh Data D4.So, Refresh Data management department 66 can time
Refresh Data is performed equably between.
In the case of multiple memory banks that predicted time is close being detected, Refresh Data management department 66
Can be after setting the order performing Refresh Data, according to situation, in several examples illustrated above
The timing of son performs Refresh Data.Although it addition, only describing the Refresh Data of last execution from finally
The example that predicted time Te starts, but Refresh Data management department 66 can also be configured to final pre-
Before survey time Te, whole memory banks that predicted time is close are performed Refresh Data.Such as, at Fig. 5 (a)
And in Fig. 5 (b), Refresh Data management department 66 can also be all to terminate before final predicted time Te
Mode perform Refresh Data D1～D4.
Fig. 6 is the flow process of an example of the Refresh Data process of the disk set 200 representing present embodiment
Figure.
At B601, disk set 200 starts, and obtains writing commands from host computer system 150, advances to
The process of B602.At B602, disk set 200 performs the write life received from host computer system 150
Make, and write management through figures portion 62 updates predicted time table G1, advances to the process of B603.
The predicted time T with reference to predicted time table G1 is judged whether at B603, MPU60.In reference
In the case of predicted time T (B603 is), look at B604, MPU60 (Refresh Data management department 66)
Look for the memory bank that predicted time is close, and advance to the process of B605.
On the other hand, in the case of without reference to predicted time T (B603's is no), advance to B611's
Process.
At B605, Refresh Data management department 66 determines whether the memory bank that predicted time is close.?
In the case of being judged as the memory bank having multiple predicted time close (B605 is), in B606, data
Refresh management department 66 and set the order performing Refresh Data, and advance to the process of B607.
At B607, Refresh Data management department 66 to perform data brush according to the order set at B606
New mode sets time started Td, and advances to the process of B608.Now, Refresh Data management
Portion 66 sets time started Td in the way of performing multiple Refresh Data equably on the time.
On the other hand, in the case of being judged as being not previously predicted memory bank around (B605's is no),
Advance to the process of B608.
At B608, Refresh Data management department 66 determines whether to have reached the memory bank of predicted time.
(B608 is) in the case of the memory bank of predicted time has been reached, in B609, data being judged as having
Refresh management department 66 and the memory bank having reached predicted time is performed Refresh Data, and advance to B610
Process.Now, in the case of B606 and B607 performs setting, Refresh Data management department 66
According to setting, multiple memory banks that predicted time is close are performed Refresh Data successively.
On the other hand, in the case of being judged as being not reaching to the memory bank of predicted time (B608's
No), advance to the process of B611.
At B610, Refresh Data management department 66 resets the time started Td of Refresh Data, terminates inside
Perform process, and advance to the process of B613.
At B611, Refresh Data management department 66 searches write number of times and has reached the memory bank of threshold value.?
B612, Refresh Data management department 66 determines whether that writing number of times has reached the memory bank of threshold value.?
It is judged as having write number of times to reach, in the case of the memory bank of threshold value (B612 is), to advance to B609
Process.In the case of being judged as not writing number of times and reached the memory bank of threshold value (B612's is no),
Advance to the process of B613.
Judge whether to send order here from host computer system 150 at B613, MPU60.It is being judged as from master
In the case of machine system 150 sends order here (B613 is), it is back to the process of B601.It is being judged as
Not in the case of host computer system 150 sends order here (B613's is no), become the state of wait.
The disk set 200 of present embodiment, when receiving writing commands from host computer system 150, is counted
Calculate the predicted time relevant to the execution of Refresh Data, it was predicted that perform Refresh Data at multiple memory banks
Timing is the most overlapping.Disk set 200 does not weighs with the timing performing the Refresh Data in multiple memory banks
Folded mode, is controlled by MPU60 (Refresh Data management department 66).And then, disk set 200
Multiple Refresh Data can also be made to disperse in time and perform.Thus, the disk dress of present embodiment
Put 200 and be prevented from multiple memory bank with identical timing execution Refresh Data.As a result, this embodiment party
The disk set 200 of the formula order to host computer system 150, it is possible at stable response performance
Reason.
Then, the variation of disk set involved by the 1st embodiment is described.At embodiment
In variation, identical reference marks is added for the part identical with aforementioned 1st embodiment, and
Description is omitted.
(variation)
Disk set the 200 and the 1st embodiment of the variation of the 1st embodiment is roughly the same
Constitute, but be divided into inside region and exterior lateral area to manage Refresh Data each memory bank.
Fig. 7 is the figure of an example of the system information 101 representing modified embodiment of the present embodiment.
The system information 101 of variation comprises predicted time table G2.Each storage of predicted time table G2
The region of body is divided into inner circumferential side (inner) and outer circumferential side (outer).
Write management through figures portion 62 is being in depositing of inner side relative to the memory bank as object on dish 1
In the case of storage body has carried out write, to the write number of times of the inner circumferential side of each memory bank shown in Fig. 7 (the
1 write number of times) count, on dish 1, it is being in depositing of outside relative to the memory bank as object
In the case of storage body has carried out write, to the write number of times of the outer circumferential side of each memory bank shown in Fig. 7 (the
2 write number of times) count.
Predicted time calculating part 64 is in the write time of the inner circumferential side of each memory bank of each Fig. 7 and outer circumferential side
Calculate predicted time T when number (k and k') and write time (t and t') are updated, and update predicted time table
The predicted time T of G2.
Refresh Data management department 66 is at the inner circumferential side of predetermined memory bank as shown in Figure 7 or outer circumferential side
Either one meet perform Refresh Data condition in the case of, the memory bank entirety that this is predetermined is held
Row Refresh Data.Such as, Refresh Data management department 66 calculates the 1st write number of times and reaches the prediction of threshold value
Time (the 1st predicted time) and the 2nd write number of times reach the predicted time (the 2nd predicted time) of threshold value,
To in advance in the case of any one that current time Tn has reached the 1st predicted time and the 2nd predicted time
Fixed memory bank performs Refresh Data.
The disk set of variation can calculate higher more pre-than the disk set precision of the 1st embodiment
The survey time.Thus, the disk set of variation can provide more steady than the disk set of the 1st embodiment
Fixed response performance.
Although the description of several embodiments, but these embodiments are intended only as example and present,
Do not really want to limit the scope of invention.These new embodiments can be implemented in other various modes,
Without departing from the scope of purport of invention, various omission can be carried out, replace, change.These embodiment party
Formula and/or its deformation are contained in scope and/or the purport of invention, and are also contained in the model of claim
Enclose the scope of described invention and equalization thereof.
Claims (8)
1. a disk set, possesses:
Dish, it has multiple groups of tracks, and the plurality of groups of tracks comprises the 1st write magnetic track and respectively with upper
State the 2nd write magnetic track that the 1st write track portion is overlapping；And
Process portion, its each by above-mentioned multiple groups of tracks, to at the write to adjacent groups of tracks
Reason corresponding write number of times counts, and when computing above-mentioned write number of times reaches the prediction of predetermined value
Between, detecting in the case of the groups of tracks of the above-mentioned predicted time approximation of computing, read this prediction
The record data of the groups of tracks of time approximation, perform upper in the time more Zao than above-mentioned predicted time afterwards
The rewriting of the groups of tracks that the record data stating reading are written to above-mentioned approximation processes.
2. the disk set of claim 1, wherein,
Above-mentioned process portion the groups of tracks of above-mentioned approximation have multiple in the case of, with impartial time interval
Perform the rewriting to each groups of tracks to process.
3. the disk set of claim 1 or 2, wherein,
Above-mentioned process portion is in until right in the difference of the groups of tracks predicted time each other of above-mentioned multiple approximations
The above-mentioned rewriting of the groups of tracks of above-mentioned approximation processed till required time in the range of situation
Under, it is judged that approximate for above-mentioned predicted time.
4. the disk set of claim 1 or 2, wherein,
The region of above-mentioned groups of tracks is radially being divided into inside region and exterior lateral area and right by above-mentioned process portion
Above-mentioned write number of times counts.
5. the disk set of claim 4, wherein,
1st counts and the 2nd counts are counted by above-mentioned process portion respectively, and the described 1st
Counts is corresponding to the write of the groups of tracks adjacent with above-mentioned inside region, described 2nd counting
Number is corresponding to the write to the groups of tracks adjacent with above-mentioned exterior lateral area.
6. the disk set of claim 5, wherein,
Above-mentioned 1st counts of above-mentioned process portion computing reach above-mentioned predetermined value the 1st predicted time and
Above-mentioned 2nd counts reaches the 2nd predicted time of above-mentioned predetermined value, is reaching above-mentioned 1st pre-
Perform above-mentioned rewriting in the case of any one of survey time and above-mentioned 2nd predicted time to process.
7. rewriteeing a processing method, it is applied to disk set, and this disk set possesses dish, this dish
Having multiple 1st groups of tracks, the plurality of 1st groups of tracks comprises the 1st write magnetic track and respectively with above-mentioned
The 2nd write magnetic track that 1st write track portion is overlapping,
The method:
Each by above-mentioned multiple groups of tracks, processes corresponding writing to the write to adjacent groups of tracks
Indegree counts, and computing above-mentioned write number of times reaches the predicted time of predetermined value；And
Detecting in the case of the groups of tracks of the above-mentioned predicted time approximation of computing, read this prediction
The record data of the groups of tracks of time approximation, perform upper in the time more Zao than above-mentioned predicted time afterwards
State the process that the record data of reading are written to the groups of tracks of above-mentioned approximation.
8. a disk set, possesses:
Dish, it has the 1st groups of tracks and 2nd groups of tracks adjacent with the 1st groups of tracks, and described
1 groups of tracks comprises the 1st write magnetic track and the overlapping with above-mentioned 1st write track portion the 2nd respectively and writes
Enter magnetic track；And
Process portion, its based on perform to the number of times of the write of above-mentioned 2nd groups of tracks i.e. write number of times and
Perform the time i.e. write time of this write, it was predicted that in the record data reading above-mentioned 1st groups of tracks
Perform afterwards the record data of above-mentioned reading are written to the time that the rewriting of above-mentioned 1st groups of tracks processes
I.e. predicted time, and based on this predicted time, perform to process to the above-mentioned rewriting of above-mentioned 1st groups of tracks.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2015034910A JP2016157498A (en) | 2015-02-25 | 2015-02-25 | Magnetic disk device and rewrite processing method |
| JP2015-034910 | 2015-02-25 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105913857A true CN105913857A (en) | 2016-08-31 |
Family
ID=56083202
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510487466.3A Pending CN105913857A (en) | 2015-02-25 | 2015-08-10 | Magnetic disk drive and rewrite processing method |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US9361944B1 (en) |
| JP (1) | JP2016157498A (en) |
| CN (1) | CN105913857A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109427347A (en) * | 2017-08-31 | 2019-03-05 | 株式会社东芝 | Disk set and the setting method of record area |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180012627A1 (en) * | 2016-07-07 | 2018-01-11 | HGST Netherlands B.V. | Managing far and near track erasure by dynamic control of a write current parameter of a magnetic disk drive |
| US10936498B2 (en) * | 2018-03-12 | 2021-03-02 | Kabushiki Kaisha Toshiba | Shingled magnetic recording drive that updates media cache data in-place |
| JP7234176B2 (en) * | 2020-03-17 | 2023-03-07 | 株式会社東芝 | Magnetic disk device and Depop processing method |
| JP7404285B2 (en) * | 2021-02-16 | 2023-12-25 | 株式会社東芝 | Magnetic disk device and write processing method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1658318A (en) * | 2004-02-16 | 2005-08-24 | 三星电子株式会社 | Method for recording data against ate and storage medium therefor |
| CN101308683A (en) * | 2007-03-26 | 2008-11-19 | 日立环球储存科技荷兰有限公司 | Disk drive device and data rewrite method thereof |
| JP4743905B2 (en) * | 2008-03-25 | 2011-08-10 | Ｎｅｃインフロンティア株式会社 | Flash memory storage life monitoring device |
| CN102237097A (en) * | 2010-05-07 | 2011-11-09 | 日立环球储存科技荷兰有限公司 | Disk drive with adaptive counting of writes to the data tracks |
| CN103168327A (en) * | 2010-10-29 | 2013-06-19 | 链接媒体设备公司 | Inter-track interference cancelation for shingled magnetic recording |
| US20130318295A1 (en) * | 2012-05-23 | 2013-11-28 | Kabushiki Kaisha Toshiba | Disk storage apparatus and write method |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6429984B1 (en) | 1999-08-06 | 2002-08-06 | Komag, Inc | Circuit and method for refreshing data recorded at a density sufficiently high to undergo thermal degradation |
| US7405893B2 (en) * | 2005-09-21 | 2008-07-29 | Seagate Technology Llc | Data storage medium with optimized servo format |
| US7945727B2 (en) | 2007-07-27 | 2011-05-17 | Western Digital Technologies, Inc. | Disk drive refreshing zones in segments to sustain target throughput of host commands |
| US8531791B1 (en) | 2012-02-01 | 2013-09-10 | Western Digital Technologies, Inc. | Methods for adaptive throttling of data refresh operations and disk drives implementing the same |
| JP2016122486A (en) * | 2014-12-25 | 2016-07-07 | 株式会社東芝 | Magnetic disc unit and write control method |
-
2015
- 2015-02-25 JP JP2015034910A patent/JP2016157498A/en active Pending
- 2015-06-15 US US14/739,462 patent/US9361944B1/en not_active Expired - Fee Related
- 2015-08-10 CN CN201510487466.3A patent/CN105913857A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1658318A (en) * | 2004-02-16 | 2005-08-24 | 三星电子株式会社 | Method for recording data against ate and storage medium therefor |
| CN101308683A (en) * | 2007-03-26 | 2008-11-19 | 日立环球储存科技荷兰有限公司 | Disk drive device and data rewrite method thereof |
| JP4743905B2 (en) * | 2008-03-25 | 2011-08-10 | Ｎｅｃインフロンティア株式会社 | Flash memory storage life monitoring device |
| CN102237097A (en) * | 2010-05-07 | 2011-11-09 | 日立环球储存科技荷兰有限公司 | Disk drive with adaptive counting of writes to the data tracks |
| CN103168327A (en) * | 2010-10-29 | 2013-06-19 | 链接媒体设备公司 | Inter-track interference cancelation for shingled magnetic recording |
| US20130318295A1 (en) * | 2012-05-23 | 2013-11-28 | Kabushiki Kaisha Toshiba | Disk storage apparatus and write method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109427347A (en) * | 2017-08-31 | 2019-03-05 | 株式会社东芝 | Disk set and the setting method of record area |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2016157498A (en) | 2016-09-01 |
| US9361944B1 (en) | 2016-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109427347A (en) | Disk set and the setting method of record area | |
| US8819375B1 (en) | Method for selective defragmentation in a data storage device | |
| CN105913857A (en) | Magnetic disk drive and rewrite processing method | |
| JP5681511B2 (en) | Information recording apparatus and information recording method | |
| US7339761B1 (en) | Method for wedge time shift calibration in a disk drive | |
| US6462896B1 (en) | Method for minimizing adjacent track data loss during a write operation in a disk drive | |
| US10163458B2 (en) | Magnetic disk device and write method | |
| CN107037976A (en) | Storage device and its method of work | |
| CN106960675B (en) | Disk set and write-in processing method | |
| CN101458932A (en) | Method and apparatus for writing data with sequential access in a disk drive | |
| US9460751B2 (en) | Binding shingled recording bands | |
| US9727265B2 (en) | Disk device and control method that controls amount of data stored in buffer | |
| US8941935B1 (en) | System and method for initiating refresh operations | |
| US8736994B2 (en) | Disk storage apparatus and write control method | |
| JP4759609B2 (en) | Tape drive control device and tape drive control method | |
| US10964344B2 (en) | Magnetic disk device having two regions of different thicknesses | |
| CN110289018A (en) | Disk set and its recording method | |
| CN105304098A (en) | Data storage device servoing heads based on virtual servo tracks | |
| CN105096965A (en) | Magnetic disk device and method of data refresh processing | |
| US20220076700A1 (en) | Data management method for magnetic disk device and magnetic disk device | |
| CN105320467B (en) | The data of disk device and disk device read method | |
| CN106486140B (en) | Disk set and write-in control method | |
| US9111565B2 (en) | Data storage device with both bit patterned and continuous media | |
| CN110277109A (en) | Disk set and its recording method | |
| US20190287566A1 (en) | Magnetic disk device and refresh processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160831 |
|
| WD01 | Invention patent application deemed withdrawn after publication |