CN1467636A - Redundant data protecting method for portable storage media - Google Patents
Redundant data protecting method for portable storage media Download PDFInfo
- Publication number
- CN1467636A CN1467636A CNA031251285A CN03125128A CN1467636A CN 1467636 A CN1467636 A CN 1467636A CN A031251285 A CNA031251285 A CN A031251285A CN 03125128 A CN03125128 A CN 03125128A CN 1467636 A CN1467636 A CN 1467636A
- Authority
- CN
- China
- Prior art keywords
- data
- tape
- redundant
- group
- xor
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000012937 correction Methods 0.000 claims description 26
- 230000008569 process Effects 0.000 claims description 18
- 238000012795 verification Methods 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 7
- 230000002441 reversible effect Effects 0.000 claims description 6
- 230000007812 deficiency Effects 0.000 claims description 3
- 230000009471 action Effects 0.000 claims description 2
- 230000007246 mechanism Effects 0.000 description 13
- 238000011084 recovery Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 239000012467 final product Substances 0.000 description 5
- 238000007726 management method Methods 0.000 description 5
- 238000013500 data storage Methods 0.000 description 4
- 241001269238 Data Species 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000005012 migration Effects 0.000 description 2
- 238000013508 migration Methods 0.000 description 2
- 238000002360 preparation method Methods 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 239000000047 product Substances 0.000 description 2
- 238000000151 deposition Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000003716 rejuvenation Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 238000007789 sealing Methods 0.000 description 1
- 239000004575 stone Substances 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Landscapes
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
The invention discloses a method for protecting mobile storage medium redundant data comprising, performing exclusive or operation bit by bit to the data in the n magnetic tapes in the tape library, creating the checking data of the n magnetic tapes, using it as the backup debugging, then writing it into the separate magnetic tape, forming debugging magnetic tapes, restoring the damaged data in the data magnetic tapes by means of the debugging magnetic tape.
Description
Technical field
The present invention relates to a kind of storage Data Protection method, the guard method of particularly a kind of movable storage medium redundant data.
Background technology
Along with the widespread use of computer technology in every profession and trade, increasing computer data produces endlessly, these data play crucial effects in various application systems, but along with the continuous increase of data volume, how intact preservation also utilize those mass datas that have been accumulated to TB even PB level to become a very important problem.We can say that stable, efficient, storage management system that can store mass data is the foundation stone of the professional system of whole computing machine, does not have reliable data storage management system, whole computer system has also just become water without a source.
At present, " data filing, recovery system " majority of being responsible for the mass data storage management is the software product of foreign vendor, exist the price height, with shortcoming such as bigger, the local supporting dynamics difference of user's request gap.Based on these factors, my company has developed " data filing, recovery management system "---the M that is used for the mass data storage management voluntarily
2Ars (Multi-channel Multi-layer Archive ﹠amp; RestoreSystem).M
2Ars has the advantage that many like products do not possess, and wherein, the redundant correcting algorithm of streaming tape is exactly M in the tape library
2Ars is exclusive.
At present, the storage administration of magnanimity computer data is on hardware configuration, popular mode is that employing is the storage architecture of core with SAN, adopt online hard disk array, the near line manipulator tape library, the multistage storage organization that informant worker's tape holder far away combines, data storage commonly used is on hard disk array, the data that usage frequency is lower are stored in the mechanical arm streaming tape storehouse by the hard disk migration, least Chang Yong data are again by spuing in the tape library, file on informant worker's tape holder far away, have only this mode of employing, could reasonably preserve, utilize the computer data of magnanimity.
Wherein, store in this link at the near line tape library, the streaming tape that leaves in the tape pool might damage after frequent use and long preservation, thereby causes storing losing of superincumbent data.For fear of loss of data, management software---M
2Ars, can recover preserving superincumbent data after damaging at tape with regard to carrying out the redundant correcting processing to the data that are kept on the streaming tape, prevents loss of data.
M
2Ars has adopted unique n+1 redundant correcting algorithm on streaming tape redundant correcting method, this error correction algorithm is different with the algorithm of present similar competing product, is M
2The ars system is exclusive.As large-scale data filing storage system, the safety of data is primary, and the safety of data is directly connected to user's interests.
The data that leave in the data tape may go wrong after after a while, and this is that the user is concerned about very much, in order to address this is that, just need carry out correction process to the data of preserving in the tape.At present, there are 2 kinds of modes to can be used to carry out the raising of data tape reliability.For the redundant correcting of tape, two kinds of present methods are: redundant and whole dish tape redundancy in the tape.Redundancy is meant in the tape, in magnetic tape reel inside, after having write one piece of data, just adds a check bit it is carried out error correction, like this, in whole dish data tape, will inevitably add the checking data of many manufacturers self.Like this, the data record format of tape can be a manufacturer oneself, in other words, uses other tape to recover software, just can not be correct read data in this dish tape.
Summary of the invention
The purpose of this invention is to provide the guard method of a kind of movable storage medium redundant data.By whole dish tape redundant correcting mechanism, make the opening of tape will obtain good assurance.
Movable storage medium redundant data of the present invention guard method may further comprise the steps:
A) by the data of coiling the sense data tape;
B), obtain total redundant data of all data tapes of reversible treatment with the data tape data step-by-step relevant treatment one by one of reading;
C) total redundant data is write in the standby tape, form the error correction tape.
Wherein, described relevant treatment comprises:
B1) at first incite somebody to action the wherein data step-by-step relevant treatment of two dish data tapes, obtain one group of redundant data;
B2) with the data step-by-step relevant treatment of this group redundant data and next dish data tape, obtain another group redundant data;
B3) data to the remainder data tape repeat the similar relevant treatment with step B2 respectively, until the total redundant data that obtains the total data tape.
Wherein, described relevant treatment is that XOR is handled.
Wherein, described relevant treatment is an addition process.
Wherein, described redundant data is a checking data.
Wherein, described relevant treatment step comprises: with the data of the 1st data tape and the data difference step-by-step XOR of the 2nd data tape, obtain the 1st group of redundant data; Data difference step-by-step XOR with the 1st group of checking data and the 3rd data tape obtains the 2nd group of redundant data, and the data difference step-by-step XOR until with n-2 group redundant data and n data tape obtains n-1 group redundant data; The integrity checking data of described n-1 group redundant data as n data tape.
Wherein, when two dish data lengths that carry out XOR when inconsistent, with the zero padding of deficiency side, step-by-step XOR then.
In addition, also comprise the step of a restore data tape, comprising: when the corrupted data of a tape, from the verification tape, take out checking data, one by one to each data recording on tape step-by-step XOR, recover to damage the data of tape by the order opposite with forming the error correction tape.
Wherein, described relevant treatment step comprises: all data step-by-step addition respectively with n coils data tape obtains one group of redundant data; The integrity checking data of this group redundant data as n data tape.
Wherein, in described step-by-step addition step, remove the overflow position of addition, to obtain redundant data.
Here of particular note, " relevant treatment " of the present invention is meant two groups or organizes data recording on tape more and handle, obtaining and these group data recording on tape related one group of checking datas (that is, redundant data), this checking data as reverse process to recover the basis of data recording on tape.
The present invention is described in detail with instantiation below in conjunction with accompanying drawing.
Description of drawings
Fig. 1 is the synoptic diagram of error correction tape generative process;
Fig. 2 is the synoptic diagram that damages tape error correction rejuvenation;
Fig. 3 is the data redundancy process flow diagram of first embodiment;
Fig. 4 is the data redundancy process flow diagram of second embodiment.
Embodiment
M of the present invention
2The principle of design of ars is exactly the opening that keeps data layout in the tape, makes third party software also can read M
2The data of ars record.If select for use the interior redundancy of tape to carry out correction process, must influence the opening of tape storage form, tape can't recover above the software at other in the future.Therefore, selected whole dish tape redundant correcting mechanism, the opening of tape will obtain good assurance like this.This mechanism is M
2Ars is exclusive.
M in actual use
2Ars has adopted following technology: the user can specify a storage pool in advance, and all tapes wherein are used for carrying out redundant storage.All tapes in nearline storage equipment in; safety of data should be protected by the manufacturer of memory device in the tape; only tape migration strategy work trigger data from nearline storage equipment when line memory device far away moves; system can be according to specific redundant arithmetic; carry out data redundancy calculating and filing according to the method that user's setting uses n dish data tape to add 1 dish redundant correcting band; even and the enforcement of this mechanism for correcting errors has only a data tape drive also can normally finish, n+1 dish tape can be moved in the line storage system far away together after finishing.The specific implementation method of this redundant correcting mechanism is as follows:
(first embodiment)
N in tape pool dish tape (the n value can freely be set according to actual needs) is carried out step-by-step XOR (XOR in the accurate logic of XOR index here).Just, (data itself are digitalized data in the tape earlier data in the two dish streaming tapes to be carried out the calculating of step-by-step XOR, read by tape operation standard function and to get final product, so-called step-by-step XOR, promptly two coil tape corresponding datas step-by-step XOR by turn, when two dish data recording on tape length are inconsistent, the zero padding of deficiency side can be alignd, and illustrates, and tape A data are 01001, tape B data are 1011, few one of latter's data are 10110 after the zero padding, and the result is 11111 behind the XOR, when tape A loss of data, taking out tape B data 1011, take out redundant back data 11111 again, is 10110 after former data is mended 0, by turn objection or after be 01001, be tape A data), the result who draws again with following magnetic tape reel in data carry out the step-by-step XOR and calculate, analogize in proper order, n is coiled data in the tape all carry out the step-by-step XOR and calculate redundant data that the back generates, write independent error correction tape as the backup error correction.Like this, in this n dish tape, there is any magnetic tape reel to damage, utilizes redundant data that other dish tape is carried out reverse step-by-step XOR and handle, the tape that damages is recovered (will be elaborated after a while).And if have more than magnetic tape reel to exist part to damage in this n dish tape, even every dish tape all has damage in various degree, as long as the position that every dish tape damages does not overlap mutually, still can recover every dish tape broken parts by redundant data.
Said process as shown in Figure 1.In processing shown in Figure 1, data tape 1 to n is divided into 6 data segments, be data segment 1 to data segment 6, each data segment by data tape 1 and the data of data tape 2 corresponding each data segment are the step-by-step XOR respectively, obtains first group of check data.With each data segment of the 1st group of checking data and each corresponding data section difference step-by-step XOR of data tape 3, obtain the 2nd group of check data then.At last, with each data segment of n-2 group checking data and each corresponding data section difference step-by-step XOR of data tape n, obtain n-1 group checking data.N-1 group checking data is write independent error correction tape, thereby form the verification tape of Fig. 1, i.e. error correction tape.Fig. 2 shows the processing procedure of the error correction recovery that damages tape.It is the reverse process process of verification tape forming process that this error correction recovers processing procedure.If data tape 1 damages, then recovering processing procedure is: the data of the checking data of verification tape and data tape n step-by-step XOR respectively obtain n-2 group checking data, the rest may be inferred, obtain the 1st group of checking data, with the data difference step-by-step XOR of the 1st group of checking data and data tape 2, obtain the data of data tape 1 then.For example, the data of supposing tape 1 are 01001, the data of tape 2 are 10110, the 1st group of checking data (redundant data) is 11111, when tape 1 loss of data, take out the checking data of verification tape and the data of data tape n, the step-by-step XOR obtains n-2 group checking data respectively, and the rest may be inferred, obtains the 1st group of checking data, promptly 11111, take out the data 10110 of tape 2 then,, obtain data 01001 with the 1st group of checking data 11111 step-by-step XORs, these data are the data of tape 1, thereby have recovered the data of tape 1.
In addition, the present invention also can have under the situation about damaging in various degree at the polydisc tape, recovers data recording on tape.For instance: tape A data 10011, tape B data 00010, the checking data after XOR calculates is 10001.If the 3rd byte of the 2nd byte of tape A data and tape B damaged simultaneously, but damage the position difference, then can be by the data of checking data 10001 restore data tape A and the data of tape B:
A:1*011 (data of tape A)
B:00*10 (data of tape B)
C:10001 (checking data that forms behind the XOR)
* represent this bit data to damage,
In B, be the 2nd bit data of A behind the 2nd XOR of C, in A, be the 3rd bit data of B behind the 3rd XOR of C.Like this, by the XOR of C and A, tape B data 00010 have been recovered; By the XOR of C and B, tape A data 10011 have been recovered.
In actual process, may run into the tape length that carries out an XOR and not wait, can be according to the tape corresponding data zero padding of the tape figure place of long band with curtailment, and then the step-by-step XOR gets final product.
Set up the algorithm 1 that recover the back of makeing mistakes in the tape storage:
If s (n)=s (1) ^s (2) ^s (3) ^s (4) ... ..^s (m);
S (m)=s (1) ^s (2) ^s (3) ^s (4) so ... ..^s (n);
Note: S (n) is the data in the n dish streaming tape;
Be that the result equals to remain not XOR value with any N-1 value step-by-step XOR result behind N the value step-by-step XOR.
Can know according to above-mentioned algorithm, if N dish tape is carried out the step-by-step XOR to be calculated, generate redundant data and back up, have any magnetic tape reel to damage in this N dish tape so, just can recover this damage tape by this redundant data and remaining N-1 dish tape.
Simultaneously, damage, but damage the nonoverlapping words in position, can recover every dish tape by redundant data if every dish tape all has in various degree.If N dish tape length does not wait, and is standard with the longest band, the not enough zero padding of remainder data gets final product.
Fig. 3 shows the data redundancy process flow diagram, and Data Recovery Process figure is similar with it, and just redundant band becomes source data, and the restore data band becomes the target data band, judges whether ending according to closing tag.
Note: BLOCK can only one one during read data reads because tape is a block device, can not arbitrarily read, and BLOCK is the tape block size.
Be described below:
S100: getting needs redundant tape;
S101: open tape, prepare reading of data;
S102: open local redundant file, data after the preparation storage redundancy;
S103: get the next BLOCK (fetching data) of tape;
S104: get equal length data in the redundant file, not enough zero padding;
S105: deposit redundant file (for calculating) after two value XORs calculate in other data recording on tape;
S106: judge whether tape arrives ending,, write end mark to redundant file as to ending,
Close this document, otherwise return S103;
S110: after tape has all been got, open redundant band, prepare the storage redundancy data
Read redundant data, all write redundant band and get final product.
(second embodiment)
This embodiment obtains the verification tape by addition process.Specifically, the dish tape of the n in the tape pool (the n value can freely be set according to actual needs) is carried out additional calculation obtain redundant data (that is, checking data), then checking data is write the standby tape of a dish, to form verification tape (that is error correction tape).Like this, by with form the reverse process that the verification tape is handled, can recover obliterated data equally.
Example 1:(8 bit data)
A:10011001 (first data recording on tape)
B:00100011 (second data recording on tape)
C:10001000 (the 3rd data recording on tape)
D=A+B+C=101000100, overflow position is removed, and the result is 01000100 (redundant data)
Tentation data A loses behind the A=D-B-C=01000100-00100011-10001000 8 and is=10011001
Example 2:(16 bit data)
A：1001100100000000
B：0010001111111111
C：1000100000000000
D=A+B+C=10100010011111111, overflow position is removed, and the result is 0100010011111111
Tentation data A loses behind the A=D-B-C 16 and is=1001100100000000
Example 3:(32 bit data)
A：10011001000000001001100100000000
B：00100011111111110010001111111111
C：10001000000000001000100000000000
D=A+B+C=101000101000000000100010011111111, for guaranteeing the figure place unanimity, overflow position is removed, and the result is 01000101000000000100010011111111
Tentation data A loses behind the A=D-B-C 32
＝10011001000000001001100100000000
Example 4:(64 bit data)
A：1001100100000000100110010000000010011001000000001001100100000000
B：0010001111111111001000111111111100100011111111110010001111111111
C：1000100000000000100010000000000010001000000000001000100000000000
D=A+B+C, overflow position is removed, and the result is
0000100000001001000010000000100100001000000010010000100000000
Tentation data A loses behind the A=D-B-C 64
10011001000000001001100100000000100110010000000010011001000000?00
Algorithm 2: if An=A0+A1 ... .+Am
Am=An-(A0+A1 so ...)
A(m)＝(Am-Cm)^Bm
N value carried out the additive operation result and carried out additive operation with N-1 value arbitrarily and equal surplus value
Note: A (n) is data in the n dish tape
Bm, Cm are two groups of constants.
The number of bits unanimity of all values, not enough zero padding.
For keeping the figure place unanimity, carry was disregarded when addition results was overflowed.
Can know according to above-mentioned algorithm 2, if N dish tape is carried out additional calculation, generate redundant data and back up, have any magnetic tape reel to damage in this N dish tape so, just can recover this damage tape by this redundant data and remaining N-1 dish tape.
Referring to Fig. 4, the treatment step of this second embodiment comprises:
S200: getting needs redundant tape
S201: open tape, prepare reading of data
S202: open local redundant file, data after the preparation storage redundancy
S203: get the next BLOCK (fetching data) of tape
S204: get equal length data in the redundant file, not enough zero padding
S205: two values carry out depositing redundant file (for calculating with other data recording on tape) in after the additional calculation
S206: judge whether tape arrives ending,, write end mark to redundant file as to ending,
Close this document, otherwise return S103
S210: after tape has all been got, open redundant band, prepare the storage redundancy data
Read superfluous and data, all write redundant band and get final product.
M of the present invention
2The advantage of ars redundant correcting mechanism comprises:
The opening of 1 data record format
Owing to adopt the mechanism of whole dish tape redundancy, every dish tape is record data itself only, and checking data all leaves in the other verification tape, so, the record format of data is open, can use third-party storage management software read data information like this in other magnetic tape station.Because system adopts independent tape as the data redundancy band, so guaranteed the form integrality of streaming tape.So the whole dish tape redundant correcting mechanism of employing makes the opening of tape obtain good assurance.Open magnetic tape format permission user uses the software of other manufacturer that the data tape in the system of the present invention is authorized and reads, and can handle for user's unit recovery operation with disaster-tolerant recovery in the future as manufacturer's user-defined format of some sealings and cause unnecessary trouble.
The high reliability of 2 data recording on tape
The data that leave in the data tape may go wrong after after a while, so must adopt certain mechanism for correcting errors to repair for corrupt data.The present invention adopts this redundant correcting mechanism, has guaranteed the data security of tape under the prerequisite that guarantees the tape opening to greatest extent.
Because adopt the method for whole dish tape redundancy, and redundant data adopts independent tape storage, so for the most whole dish tape damaged condition of normal generation, the present invention can generate the tape of redundant data according to redundancy band and other, and the tape that damages is recovered.And, when the redundancy band damages, normally reading of other data recording on tape do not exerted an influence, and can regenerate redundant band.And the method for redundancy in the employing tape, when whole dish tape damages, in any case all data recording on tape can't be recovered.And adopt this error correction algorithm of the present invention, when more than magnetic tape reel data take place partly to damage, as long as the position that is damaged does not overlap mutually, still can be according to redundant data with the corrupt data reparation, so guaranteed the high reliability of data recording on tape.
3 redundant arithmetic processing speeds are fast
Redundant disposal route of the present invention adopts and handles position XOR algorithm simple and that easily recover.If redundant arithmetic is too complicated, often cause arithmetic speed slow, data are recovered also relative complex, and implement also relatively difficulty, finally can influence the up-time efficiency of software.Position XOR algorithm is simple, and travelling speed is fast, and can oppositely recover to participate in the value of XOR, is algorithm the most frequently used in redundant correcting mechanism.
The quantity of 4 pairs of tape drives does not have special requirement
Adopt the redundant correcting mechanism of this n+1, need tape drive to read legacy data and write data to generate the error correction tape, still this mechanism does not have special requirement to the quantity of tape drive, does not need the error correction driver of additional configuration special use.M
2Ars can at first write the buffer zone of reserving in the hard disk with error correction data, after waiting the data of filing tape to write to finish, re-uses idle driver and generates the error correction tape.Under the situation of the limit, only need a tape drive can finish redundant task.
5 only need hard disk cushion space seldom
Because M
2Ars just calculates data in the virgin tape and the buffer zone error correction data that generated last time, form new error correction data after, write back buffer zone again, cover legacy data, write the error correction tape at last, Free up Memory is got process use ready.So, the hard disk cushion space that generating the error correction tape needs is fixed all the time, and its size also can not surpass the capacity of a dish data tape, and the sort buffer space is very little for large-scale hard disk array, can not cause extra pressure to storage system.
Claims (10)
1, a kind of movable storage medium redundant data guard method may further comprise the steps:
A) by the data of coiling the sense data tape;
B), obtain total redundant data of all data tapes of reversible treatment with the data tape data step-by-step relevant treatment one by one of reading;
C) total redundant data is write in the standby tape, form a dish error correction tape.
2, method according to claim 1, wherein said relevant treatment comprises:
B1) at first incite somebody to action the wherein data step-by-step relevant treatment of two dish data tapes, obtain one group of redundant data;
B2) with the data step-by-step relevant treatment of this group redundant data and next dish data tape, obtain another group redundant data;
B3) data to the remainder data tape repeat the relevant treatment identical with step B2 respectively, until the total redundant data that obtains the total data tape.
3, according to claim 1,2 described methods, wherein, described relevant treatment is that XOR is handled.
4, method according to claim 1, wherein, described relevant treatment is an addition process.
5, according to claim 1,2,4 described methods, wherein, described redundant data is a checking data.
6, method according to claim 3, wherein said relevant treatment step comprises:
With the data of the 1st data tape and the data difference step-by-step XOR of the 2nd data tape, obtain the 1st group of redundant data;
Data difference step-by-step XOR with the 1st group of checking data and the 3rd data tape obtains the 2nd group of redundant data, and the data difference step-by-step XOR until with n-2 group redundant data and n data tape obtains n-1 group redundant data;
The integrity checking data of described n-1 group redundant data as n data tape.
7, method according to claim 6, wherein, when two dish data lengths that carry out XOR when inconsistent, with the zero padding of deficiency side, step-by-step XOR then.
8, method according to claim 6, the step that also comprises a restore data tape, comprise: when the corrupted data of a tape, from the verification tape, take out checking data, one by one to each data recording on tape step-by-step XOR, recover to damage the data of tape by the processing procedure opposite with error correction tape forming process.
9, method according to claim 4, wherein said relevant treatment step comprises:
All data step-by-step addition respectively with n coils data tape obtains one group of redundant data;
The integrity checking data of this group redundant data as n data tape.
10, method according to claim 9 wherein in described step-by-step addition step, is removed the overflow position of addition, to obtain redundant data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03125128 CN1234072C (en) | 2003-05-10 | 2003-05-10 | Redundant data protecting method for portable storage media |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 03125128 CN1234072C (en) | 2003-05-10 | 2003-05-10 | Redundant data protecting method for portable storage media |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1467636A true CN1467636A (en) | 2004-01-14 |
| CN1234072C CN1234072C (en) | 2005-12-28 |
Family
ID=34152955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 03125128 Expired - Lifetime CN1234072C (en) | 2003-05-10 | 2003-05-10 | Redundant data protecting method for portable storage media |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1234072C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567147A (en) * | 2011-12-29 | 2012-07-11 | 北京遥测技术研究所 | Hard disk array controller based on double hard disk redundancy |
| CN103064274A (en) * | 2012-12-03 | 2013-04-24 | 珠海艾派克微电子有限公司 | Imaging box chip, data processing method and imaging box |
| CN106354669A (en) * | 2015-07-13 | 2017-01-25 | 国民技术股份有限公司 | Memory with hierarchical structure |
| CN110389855A (en) * | 2018-04-19 | 2019-10-29 | 浙江宇视科技有限公司 | Tape library data verification method, device, electronic equipment and readable storage medium storing program for executing |
-
2003
- 2003-05-10 CN CN 03125128 patent/CN1234072C/en not_active Expired - Lifetime
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567147A (en) * | 2011-12-29 | 2012-07-11 | 北京遥测技术研究所 | Hard disk array controller based on double hard disk redundancy |
| CN102567147B (en) * | 2011-12-29 | 2015-05-27 | 北京遥测技术研究所 | Hard disk array controller based on double hard disk redundancy |
| CN103064274A (en) * | 2012-12-03 | 2013-04-24 | 珠海艾派克微电子有限公司 | Imaging box chip, data processing method and imaging box |
| WO2014086137A1 (en) * | 2012-12-03 | 2014-06-12 | 珠海艾派克微电子有限公司 | Imaging cartridge chip, data processing method and imaging cartridge |
| CN103064274B (en) * | 2012-12-03 | 2015-02-04 | 珠海艾派克微电子有限公司 | Imaging box chip, data processing method and imaging box |
| CN106354669A (en) * | 2015-07-13 | 2017-01-25 | 国民技术股份有限公司 | Memory with hierarchical structure |
| CN106354669B (en) * | 2015-07-13 | 2021-03-26 | 国民技术股份有限公司 | Memory with hierarchical structure |
| CN110389855A (en) * | 2018-04-19 | 2019-10-29 | 浙江宇视科技有限公司 | Tape library data verification method, device, electronic equipment and readable storage medium storing program for executing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1234072C (en) | 2005-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1191518C (en) | Transformational raid for hierarchical storage management system | |
| JP5192587B2 (en) | Memory system copyback optimization | |
| US9405639B2 (en) | Systems and methods for retrieving data | |
| CN1235220C (en) | Information recording device, information recording method, and program | |
| CN101937374B (en) | Non-volatile memory to store memory remap information | |
| JP5675954B2 (en) | Detection of irregular parity distribution via metadata tag | |
| US20180204594A1 (en) | Error Correction for Storage Devices | |
| US9311006B2 (en) | Table journaling in flash storage devices | |
| CN1904858A (en) | Data-storage apparatus, data-storage method and recording/reproducing system | |
| CN1264163C (en) | Information processor, information processing methodm medium recording information processing method | |
| CN1201231C (en) | Data storage, data processing system and method | |
| CN1717661A (en) | Data recording apparatus | |
| CN101051283A (en) | Hard disc data backup system and method | |
| CN103389942A (en) | Control device, storage device, and storage control method | |
| CN1234072C (en) | Redundant data protecting method for portable storage media | |
| CN109445982A (en) | Realize the data storage device of data reliable read write | |
| CN1248101C (en) | Method and device for producing multistage random number effective sequence | |
| CN1670853A (en) | Encoding apparatus | |
| CN1725354A (en) | Data processing apparatus and method | |
| CN109358984A (en) | The storage device of data recovery is carried out using temperature equalization data reconstruction method | |
| CN1324474C (en) | System and method for detecting write errors in a storage device | |
| JP2008251063A (en) | Storage device | |
| JP4251379B2 (en) | Flash memory system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Assignee: TIANJIN MARSTOR TECHNOLOGY Co.,Ltd. Assignor: BEIJING ASIA CREATION TECHNOLOGY Co.,Ltd. Contract fulfillment period: 2009.9.30 to 2019.9.29 Contract record no.: 2009120000265 Denomination of invention: Redundant data protecting method for portable storage media Granted publication date: 20051228 License type: Exclusive license Record date: 20091113 |
|
| LIC | Patent licence contract for exploitation submitted for record |
Free format text: EXCLUSIVE LICENSE; TIME LIMIT OF IMPLEMENTING CONTACT: 2009.9.30 TO 2019.9.29; CHANGE OF CONTRACT Name of requester: TIANJIN MARSTOR TECHNOLOGY CO.,LTD. Effective date: 20091113 |
|
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: Redundant data protecting method for portable storage media Effective date of registration: 20100810 Granted publication date: 20051228 Pledgee: Zhongguancun Beijing science and technology Company limited by guarantee Pledgor: BEIJING ASIA CREATION TECHNOLOGY Co.,Ltd. Registration number: 2010990000840 |
|
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20130823 Granted publication date: 20051228 Pledgee: Zhongguancun Beijing technology financing Company limited by guarantee Pledgor: BEIJING ASIA CREATION TECHNOLOGY Co.,Ltd. Registration number: 2010990000840 |
|
| PLDC | Enforcement, change and cancellation of contracts on pledge of patent right or utility model | ||
| PM01 | Change of the registration of the contract for pledge of patent right |
Change date: 20130823 Registration number: 2010990000840 Pledgee after: Zhongguancun Beijing technology financing Company limited by guarantee Pledgee before: Zhongguancun Beijing science and technology Company limited by guarantee |
|
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: Room 301, floor 3, building 5, yard 16, Meiliyuan Middle Road, Haidian District, Beijing 100097 Patentee after: Beijing Mars high tech digital technology Co.,Ltd. Address before: 100080 room 9015, computer city, Silicon Valley, Beijing, Haidian District Patentee before: BEIJING ASIA CREATION TECHNOLOGY Co.,Ltd. |
|
| CX01 | Expiry of patent term | ||
| CX01 | Expiry of patent term |
Granted publication date: 20051228 |