CN1310389A - Computer hard disk data copying method and system - Google Patents

Computer hard disk data copying method and system Download PDF

Info

Publication number
CN1310389A
CN1310389A CN 00102381 CN00102381A CN1310389A CN 1310389 A CN1310389 A CN 1310389A CN 00102381 CN00102381 CN 00102381 CN 00102381 A CN00102381 A CN 00102381A CN 1310389 A CN1310389 A CN 1310389A
Authority
CN
China
Prior art keywords
stamper
dish
data
subregion
total volume
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
Application number
CN 00102381
Other languages
Chinese (zh)
Other versions
CN1110754C (en
Inventor
林光信
陈玄同
周洪喜
史永军
Original Assignee
Inventec Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Inventec Corp filed Critical Inventec Corp
Priority to CN 00102381 priority Critical patent/CN1110754C/en
Publication of CN1310389A publication Critical patent/CN1310389A/en
Application granted granted Critical
Publication of CN1110754C publication Critical patent/CN1110754C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Signal Processing For Digital Recording And Reproducing (AREA)

Abstract

The present invention is used to copy some specific software program fast to computer hard disks during computer production or to back up hard disk data, that is, restore primary data to hard disk with failed data. The method and system features that through data duplication rather than file duplication, data in mother disk are copied to son disk. Compared with available technology, the present invention has fast copying speed. In addition, during copying, file directory and file distribution list in son disk are not modified and this can ensure the safety of son disk system.

Description

Computer hard disk data copying method and system
The present invention relates to a kind of computer hard disk data copying technology, particularly a kind of hard disk data copying method and system that is applicable to computer line.
The hard disc of computer reproduction technology can be applicable on the computer line, in order to specific software program is copied on the hard disk of each computing machine on the production line apace, uses and enhances productivity.For example, general now personal computer has all been record Windows 98 operating systems and Office 97 application software in advance.If do not adopt the hard disc of computer reproduction technology, and the installation procedure (setup) of the standard of employing, then the hard disk on each personal computer will be installed Windows 98 and Office 97 softwares, needs tens of minutes time just can finish at least.For thousands of personal computer on the computer line, this obviously is an infeasible method.
Known hard disc of computer reproduction technology is that Windows 98 and Office 97 softwares are installed on (this hard disk is commonly referred to as " stamper ") on the hard disk in advance, and the All Files in Windows on this hard disk 98 and the Office97 software (hereinafter referred to as " raw data ") is compressed into an image file; When duplicating hard disk, again this image file is decompressed, and each file after will decompressing writes (this hard disk is commonly referred to as " son dish ") on the hard disk of each personal computer.Fig. 1 shows the system module synoptic diagram of this known hard disc of computer clone method.As shown in the figure, this known hard disk data copying method is in order to one group of raw data of will be pre-recorded on the stamper 10, for example is aforesaid Windows 98 and Office97 software, is copied on the son dish 20.This known hard disc of computer clone method at first utilizes a stamper read module 11 with each file FILE_1, FILE_2 on the stamper 10 ..., FILE_N reads out (file that reads out is that 12 square is represented with label); Then utilize again a compression module 13 with each file of read out FILE_1, FILE_2 ..., FILE_N compresses one by one, and all is stored to an image file 14.When carrying out copying, utilize 21 pairs of reflections of decompression module file 14 to decompress actual again; Then utilize each file after a son dish module for reading and writing 22 will decompress to write to one by one on the son dish 20 again.
The raw data of utilizing above-mentioned known method to duplicate 1 GB (gigabyte), its required time is about 10 minutes and 26 seconds.
Yet the shortcoming of above-mentioned hard disk data copying method is that speed is slower, and system protection is also poor.This is because this known hard disk data copying method is to be based upon on the basis of file system (file system); Be its be at first by the file allocation table of inquiry on the stamper (File Allocation, Table, FAT) and File Directory Table (File Directory Table FDT), reads All Files on the stamper.Then in reproduction process, at first need total volume and subregion (partition) situation, revise File Directory Table FDT and file allocation table FAT on the son dish according to the child dish; Then image file is decompressed again, with each file of the raw data that obtains stamper; File after again these being decompressed at last writes on the son dish one by one.These steps make known hard disk data copying method seem comparatively complicated, so reproduction speed is still very not desirable.Particularly under the stamper situation different with the total volume of son dish, it is slower that reproduction speed will become, and unstable.
The shortcoming of known technology in view of the above, fundamental purpose of the present invention is to provide a kind of hard disk data copying method and system of novelty, and it can be copied to the stamper data on the son dish more quickly than known method.
Another object of the present invention is to provide a kind of hard disk data copying method and system of novelty, it can revise the File Directory Table FDT and the file allocation table FAT of son dish, to guarantee the security of sub-disc system in reproduction process.
Another purpose of the present invention is to provide a kind of hard disk data copying method and system of novelty, and it can not provide quick and safe hard disk data copying under the stamper situation different with the total volume of son dish.
According to above-described purpose, the invention provides a kind of computer hard disk data copying method and system of novelty.Described method comprises following steps: (1) carries out an initial program, in order to the stamper data are made an image file, its an include file head and a packed data district; This initial program comprises following subroutine: (1-1) carry out a stamper fetch program, read out in order to the hard disk praameter and the raw data that will be stored on the stamper; Reach and (1-2) carry out a piecemeal condensing routine, in order to being compressed into a plurality of compression data blocks with the piecemeal compress mode from the raw data that this stamper reads out; (1-3) carry out an image file production process, in order to will being stored to the file header the image file, and the packed data that the piecemeal condensing routine is exported is stored to packed data district in this image file from the hard disk praameter that stamper reads out; (2) carry out a replicon disc program, it comprises following subroutine: (2-1) carry out a son dish supervisory programme, in order to monitor the total volume of son dish; (2-2) carry out one first comparison program, do a comparison in order to the total length of the raw data of will be stored on the total volume of child dish and the stamper; If the total volume of son dish is then ended program less than the total length of the raw data of being stored on the stamper; (2-3) carry out one second comparison program, in order to the total volume of child dish and the total volume of stamper are done one relatively; (2-4) this child dish is carried out a son dish partition programs; If the total volume of son dish equates with the total volume of stamper, then carry out one first son dish dynamic partition program, it makes subregion according to the partitioned mode of this stamper to this child dish fully; If the total volume of son dish, is then carried out one second son dish dynamic partition program less than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; If the total volume of son dish, is then carried out one the 3rd son dish dynamic partition program greater than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; (2-5) carry out a gunzip, in order to the packed data of being stored in the packed data district in this image file is made decompression; And (2-6) carry out a write-in program, write one by one on each corresponding subregion on the son dish according to its former subregion in order to decompressed data that gunzip is exported at stamper.
Described system is copied on the son dish in order to one group of raw data that will be installed in advance on the stamper; This computer hard disk data copying system comprises: (a) stamper read module reads out in order to the hard disk praameter and the raw data that will be stored on the stamper; (b) a piecemeal compression module is handled in order to the raw data that reads out from this stamper is carried out piecemeal compression; (c) image file is made module, and in order to make an image file, it comprises a file header and a packed data district; Wherein file header is in order to store the hard disk praameter that reads out from stamper, and the packed data district is then in order to store the packed data that this piecemeal compression module is exported; (d) a son dish module for reading and writing, but its antithetical phrase dish is carried out read-write motion; (e) comparison module can be carried out one first comparison program, does one relatively in order to the total length of the raw data of will be stored on the total volume of child dish and the stamper; If the total volume of son dish is then ended program less than the total length of the raw data of being stored on the stamper; Otherwise then carry out one second comparison program, in order to the total volume of child dish and the total volume of stamper are done one relatively; And (f) decompression module, in order to the packed data of being stored in the packed data district in this image file is made a decompression; Wherein should child dish module for reading and writing can and then this child dish be carried out a son dish partition programs; If the total volume of son dish equates with the total volume of stamper, then carry out one first son dish dynamic partition program, it makes subregion according to the partitioned mode of this stamper to this child dish fully; If the total volume of son dish, is then carried out one second son dish dynamic partition program less than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; If the total volume of son dish, is then carried out one the 3rd son dish dynamic partition program greater than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; After finishing son dish subregion, then and then carry out a write-in program, write one by one on each corresponding subregion on the son dish according to its former subregion at stamper in order to decompressed data that this decompression module is exported.
One that the method and system are different with known technology is characterised in that, the method and system adopt the data copy mode, but not the file copy mode that known technology is adopted is copied to the raw data on the stamper on the son dish; Therefore it can be copied to the stamper data on the son dish more quickly than known technology, and in reproduction process, can revise the File Directory Table and the file allocation table of son dish, thereby can guarantee the security of sub-disc system.
For allowing above and other objects of the present invention, feature and the advantage can be clearer and more definite understandable, hereinafter will lift a preferred embodiment, and conjunction with figs., describe embodiments of the invention in detail.
Fig. 1 shows that the system module signal of a known hard disc of computer clone method penalizes;
Fig. 2 shows the system module synoptic diagram of hard disc of computer clone method of the present invention;
Fig. 3 is a process flow diagram, wherein shows each main program in the hard disc of computer clone method of the present invention;
Fig. 4 is a process flow diagram, wherein shows the detailed step of employed son dish dynamic partition program in the hard disc of computer clone method of the present invention;
Fig. 5 is a synoptic diagram, and it is in order to show hard disc of computer clone method of the present invention, and under the situation of child dish total volume less than the stamper total volume, the son dish corresponds to the partitioned mode of stamper.
Fig. 2 shows the system module synoptic diagram of hard disc of computer clone method of the present invention; Fig. 3 then shows the operational flowchart of hard disc of computer clone method of the present invention.
As shown in Figure 2, hard disk data copying method of the present invention and system are copied on the son dish 20 in order to one group of data (hereinafter referred to as " raw data ") of will be pre-recorded on the stamper 10.The raw data of being pre-recorded on the stamper 10 for example is aforesaid Windows 98 and Office 97 softwares, and son dish 20 then for example is the Primary Hard Drive on the personal computer.
Hard disk data copying method of the present invention and system comprise two master routines: (1) initial program; And (2) replicon disc program.Initial program is in order to the stamper data are made an image file earlier; And in the replicon disc program, recover the stamper data in the image file again, and write on the son dish.(1) initial program
See figures.1.and.2, initial program comprises following steps: (1-1) the stamper fetch program 311; (1-2) the piecemeal condensing routine 312; And (1-3) image file production process 313.(1-1) the stamper fetch program
At first utilize a stamper read module 110 to carry out a stamper fetch program 11, in order to the hard disk praameter that reads stamper 10 and raw data (data that read out are that 120 square is represented with label); Wherein hard disk praameter comprises the sector sum TOTAL_SECTORS and the partition data PARTITION_INFO of stamper 10.Sector sum TOTAL SECTORS represents that all have stored the sum of the sector of raw data on the stamper 10, promptly represents the total length of the raw data of being stored on the stamper 10; Partition data PARTITION_INFO then represents the subregion situation on the stamper 10.
One that the present invention is different with known technology is characterised in that, the present invention adopts the data copy mode, but not the file copy mode that known technology adopted reads out the raw data on the stamper 10 and be copied on the son dish 20.During the raw data of stamper read module 110 on reading stamper 10, be the sector (used sectors) of only reading data storage, and do not read the sector (unusedsectors) of no datat storage.This practice can be avoided containing useless data in the made image file, and increases the length of image file meaninglessly.For example if the total volume of stamper 10 is 2.5GB, and the total length of the raw data of being stored on it is 1GB, and then image file should only comprise the data of this 1GB.The concrete practice of this step is at first to find out the memory location of each file by the file allocation table FAT of each subregion on the stamper 10, that is store (cluster) number of trooping of each file; Then calculate the sector position that all have stored file data again according to resulting cluster number yardage; Then just the data read of being stored in these sectors is come out again.
From the raw data that stamper 10 reads out, be according to a default block length, be divided into a plurality of blocks (blocks), BLOCK_1 as shown in the figure, BLOCK_2 ..., BLOCK_N.(1-2) piecemeal condensing routine
Then utilize a piecemeal compression module 130 to carry out a piecemeal condensing routine 12, in order to each block data BLOCK_1, the BLOCK_2 that will read out from stamper 10 ..., BLOCK_N does nondestructive compression and handles.
The compression method that is adopted in this step can be any suitable well known compression methods.Generally speaking, the stamper data of 1GB can obtain being approximately the packed data of 0.5GB after general non-destructive compression is handled.(1-3) image file production process
Image file production process 313 is that sector sum TOTAL_SECTORS that program (1-1) is read out and partition data PARTITION_INFO directly deposit the file header (Header) 141 to image file 140 in, and deposits the packed data of program (1-2) gained in to image file 140 packed data district 142.(2) replicon disc program
The replicon disc program comprises following key step: (2-1) son dish supervisory programme 321; (2-2) first comparison program 322; (2-3) second comparison program 323; (2-4) son dish partition programs 3241,3242,3243; (2-5) gunzip 325: and (2-5) write-in program 326.(2-1) son dish supervisory programme
The actual son that carries out coils when duplicating, and at first utilizes a son dish module for reading and writing 210 to carry out a son dish supervisory programme, in order to monitor the total volume of sub-dish 20.(2-2) first comparison program
Then utilize a comparison module 220 to carry out one first comparison program 322, do one relatively in order to the total length of the raw data of will be stored on the total volume of child dish 20 and the stamper 10.
If the total volume of son dish 20 is less than the total length of the raw data of being stored on the stamper 10, the insufficient memory of expression dish 20 then, therefore program will skip to step 3221, end the carrying out of reproducer, and demonstrate the signal that reports an error; Otherwise then program skips to next step 323, carries out second comparison program.(2-3) second comparison program
Second comparison program 323 is in order to the total volume of relatively more sub-dish 20 and the total volume of stamper 10, uses the foundation of making subregion as child dish 20.If equal, then program skips to step 3241, carries out one first son dish dynamic partition program; If less than, then program skips to step 3242, carries out one second son dish dynamic partition program; And if greater than, then program skips to step 3243, carries out one the 3rd son dish dynamic partition program.(2-4) son dish dynamic partition program
Son dish partition programs is according to the magnitude relationship of the total volume of the total volume of child dish 20 and stamper 10, and the slightly different practices is arranged respectively.Below suppose: n represents the subregion sum of stamper 10; NS[n] represent the quantity of the raw data of being stored on n the subregion of stamper 10; MS[n] represent the maximum subregion number of sectors of stamper 10; RS0[n] represent not subregion before, the initial preset capacity value of n subregion of son dish 20; RS[n] represent behind subregion the capacity of n subregion of son dish 20.
The comparative result of the total volume of son dish 20 and the total volume of stamper 10 has following three kinds of different situations.(situation-1) is if son dish total volume equals the stamper total volume
If the total volume of son dish 20 equals the total volume of stamper 10, then carry out the first dynamic partition program 3241, it makes subregion according to the former partitioned mode antithetical phrase dish 20 of stamper 10 fully.(situation-2) is if son coils total volume less than the stamper total volume
If the total volume of son dish 20 is then carried out the second dynamic partition program 3242 less than the total volume of stamper 10, its detailed step as shown in Figure 4.(step 411)
At first in step 411, carry out the total volume of following formula: XS=[dish]-[total length of the raw data on the stamper] [total length of the raw data on the stamper]=∑ NS[n wherein] (step 412)
Then in step 412, differentiate whether following inequality is true:
XS>RS[n]-NS[n]? if then program skips to step 413; Otherwise if not, then program skips to step 414.(step 413)
In step 413, carry out following formula:
XS=XS-(RS[n]-NS[n]);n=n-1
Then skip back to step 412.(step 414)
In step 414, carry out following formula:
RS[n]=RS0[n]+XS
XS=0
Follow termination routine.
For instance, as shown in Figure 5, the total volume of supposing stamper is 1.5, and is divided into 3 subregions, and its size is respectively 400MB, 600MB, 800MB, and the useful data of wherein storage is respectively 100MB, 200MB, 300BM; And the total volume of son dish only is 1GB.
Because the data total length on the stamper is 100MB+200BM+300MB=600MB, it is still less than the total volume of child dish, so the useful data on the stamper still can all duplicate so far on the son dish.
Suppose NS[n], n=1,2,3 represent the length of the data of each section post storage on the stamper, then
NS[1]=100MB+C
NS[2]=200MB
NS[3]=300MB is wherein
C is a default constant, and its value is represented the start-up system program of being stored on the main partition (primary partition) of stamper and the total length of virtual memory data.Calculate for convenient, the preferable practice for example is 100MB or 200MB for the C value is made as whole hundred multiples bigger than the length of these type of data.
Suppose that XS represents the difference of total length between the two of the total volume of son dish and stamper data, then under the situation of C=200MB,
XS=1GB-(NS[1]+NS[2]+NS[3])
=1GB-(300MB+200MB+300MB)
=200MB
Suppose RS[n], n=1, on behalf of son dish, 2,3 utilize the size of each subregion that this dynamic partition method obtains, then in principle
RS[1]≥NS[1]
RS[2]≥NS[2]
RS[3]≥NS[3]
In the preferred embodiment of the present invention, be with remaining storage space XS with reverse apportion design priority allocation to last subregion (also be the 3rd subregion RS[3]).But because the capacity of each subregion has maximum higher limit, thus XS differ all be dispensed to n subregion RS[n surely]; In the case, the surplus of then following XS is dispensed to n-1 subregion RS[n-1]; The rest may be inferred, till XS all distributes.
In last example, suppose that the residual memory space XS=200MB of son dish can all be dispensed to last subregion RS[3], therefore get
RS[1]=300MB
RS[2]=200MB
RS[3]=500MB then just according to this mode antithetical phrase dish 20 make subregion.(situation-3) is if son coils total volume greater than the stamper total volume
If the total volume of son dish 20 is then carried out the 3rd dynamic partition program 3243 greater than the total volume of stamper 10, its detailed step as shown in Figure 4.(step 421)
At first in step 421, carry out following formula:
The total volume of XS=[dish]-[total volume of stamper] (step 422)
Then in step 422, differentiate whether following inequality is true:
XS>MS[n]-RS[n] if then program skips to step 423; Otherwise if not, then program skips to step 426.(step 423)
In step 423, carry out following formula:
RS[n]=MS[n]
XS=XS-(MS[n]-RS[n])
n=n-1
Then skip back to step 424.(step 424)
Then in step 424, differentiate whether following inequality is true:
N=0?
If then program skips to step 425; Otherwise if not, then program skips back to step 422.(step 425)
In step 425, carry out an error-reporting routine.(step 426)
In step 426, carry out following formula:
RS[n]=RS0[n]+XS
Follow termination routine.(2-5) gunzip
Then utilize a decompression module 230 to carry out a gunzip 325, decompress with the packed data that will be stored in the packed data district 142 in the image file 140.(2-6) write-in program
Utilize son dish module for reading and writing 210 to carry out last write-in program 326 at last again, the decompressed data in order to aforesaid gunzip 325 is exported writes on sub each corresponding subregion that coils on 20 one by one by its former subregion at stamper.This promptly finishes duplicating of son dish 20.
Hard disc of computer clone method of the present invention and system adopt the data copy mode, but not the file copy mode that known technology adopted is copied to the raw data on the stamper on the son dish; Therefore it can be copied to the stamper data on the son dish more quickly than known technology, and in reproduction process, can revise the file allocation table of son dish, to guarantee the security of sub-disc system.Learn by experiment.The raw data of utilizing the present invention to duplicate 1GB, its required time is about 8 minutes and 20 seconds; Relatively known method is required 10 minutes and 26 seconds, and the present invention is obviously more quick than known method.
The above is preferred embodiment of the present invention only, is not in order to limit scope of the present invention; All other do not break away from the equivalence change of being finished under the disclosed spirit or modifies, and all should be included in the scope of following claim.

Claims (6)

1. computer hard disk data copying method, it can be copied to the one group of raw data that is installed in advance on the stamper on the one son dish;
This computer hard disk data copying method comprises following steps:
(1) carries out an initial program, in order to the stamper data are made an image file, its an include file head and a packed data district; This initial program comprises following subroutine:
(1-1) carry out a stamper fetch program, read out in order to the hard disk praameter and the raw data that will be stored on the stamper; And
(1-2) carry out a piecemeal condensing routine, in order to being compressed into a plurality of compression data blocks with the piecemeal compress mode from the raw data that this stamper reads out;
(1-3) carry out an image file production process, in order to will being stored to the file header the image file, and the packed data that the piecemeal condensing routine is exported is stored to packed data district in this image file from the hard disk praameter that stamper reads out;
(2) carry out a replicon disc program, it comprises following subroutine:
(2-1) carry out a son dish supervisory programme, in order to monitor the total volume of son dish;
(2-2) carry out one first comparison program, do a comparison in order to the total length of the raw data of will be stored on the total volume of child dish and the stamper; If the total volume of son dish is then ended program less than the total length of the raw data of being stored on the stamper;
(2-3) carry out one second comparison program, in order to the total volume of child dish and the total volume of stamper are done one relatively;
(2-4) this child dish is carried out a son dish partition programs;
If the total volume of son dish equates with the total volume of stamper, then carry out one first son dish dynamic partition program, it makes subregion according to the partitioned mode of this stamper to this child dish fully;
If the total volume of son dish, is then carried out one second son dish dynamic partition program less than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again;
If the total volume of son dish, is then carried out one the 3rd son dish dynamic partition program greater than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again;
(2-5) carry out a gunzip, in order to the packed data of being stored in the packed data district in this image file is made decompression; And
(2-6) carry out a write-in program, write one by one on each corresponding subregion on the son dish according to its former subregion at stamper in order to decompressed data that gunzip is exported.
2. computer hard disk data copying method as claimed in claim 1, wherein in described step (1-1), the program that the raw data that is stored on the stamper is read out may further comprise the steps:
All that utilize that file allocation table finds out on the stamper storage raw data are trooped;
Utilize resulting trooping, try to achieve the sector of all storage raw data on the stamper; And
From these sectors, the raw data on the stamper is read out.
3. computer hard disk data copying method as claimed in claim 1, wherein this second son dish dynamic partition program be residual memory space with the child dish with a reverse apportion design priority allocation to last subregion; The unallocated intact previous subregion that then is dispensed to; The rest may be inferred, till residual memory space all distributes.
4. a computer hard disk data copying system is copied on the son dish in order to one group of raw data that will be installed in advance on the stamper; This computer hard disk data copying system comprises:
(a) a stamper read module reads out in order to the hard disk praameter and the raw data that will be stored on the stamper;
(b) a piecemeal compression module is handled in order to the raw data that reads out from this stamper is carried out piecemeal compression;
(c) image file is made module, and in order to make an image file, it comprises a file header and a packed data district; Wherein file header is in order to store the hard disk praameter that reads out from stamper, and the packed data district is then in order to store the packed data that this piecemeal compression module is exported;
(d) a son dish module for reading and writing, but its antithetical phrase dish is carried out read-write motion;
(e) comparison module can be carried out one first comparison program, does one relatively in order to the total length of the raw data of will be stored on the total volume of child dish and the stamper; If the total volume of son dish is then ended program less than the total length of the raw data of being stored on the stamper; Otherwise then carry out one second comparison program, in order to the total volume of child dish and the total volume of stamper are done one relatively; And
(f) decompression module is in order to make a decompression with the packed data of being stored in the packed data district in this image file;
Wherein
This child dish module for reading and writing can and then carry out a son to this child dish and coils partition programs; If the total volume of son dish equates with the total volume of stamper, then carry out one first son dish dynamic partition program, it makes subregion according to the partitioned mode of this stamper to this child dish fully; If the total volume of son dish, is then carried out one second son dish dynamic partition program less than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; If the total volume of son dish, is then carried out one the 3rd son dish dynamic partition program greater than the total volume of stamper, its subregion with the child dish at first is set at the data volume of each subregion of stamper and equates that the residual memory space of following the child dish is dispensed to each subregion again; After finishing son dish subregion, then and then carry out a write-in program, write one by one on each corresponding subregion on the son dish according to its former subregion at stamper in order to decompressed data that this decompression module is exported.
5. computer hard disk data copying as claimed in claim 4 system, wherein this stamper read module will be stored in the program that the raw data on the stamper reads out and may further comprise the steps:
All that utilize that file allocation table finds out on the stamper storage raw data are trooped.
Utilize resulting trooping, try to achieve the sector of all storage raw data on the stamper; And
From these sectors, the raw data on the stamper is read out.
6. computer hard disk data copying as claimed in claim 4 system, in second wherein should the child dish module for reading and writing performed son dish dynamic partition program be residual memory space with the child dish with a reverse apportion design priority allocation to last subregion; The unallocated intact previous subregion that then is dispensed to; The rest may be inferred, till residual memory space all distributes.
CN 00102381 2000-02-21 2000-02-21 Computer hard disk data copying method and system Expired - Fee Related CN1110754C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 00102381 CN1110754C (en) 2000-02-21 2000-02-21 Computer hard disk data copying method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 00102381 CN1110754C (en) 2000-02-21 2000-02-21 Computer hard disk data copying method and system

Publications (2)

Publication Number Publication Date
CN1310389A true CN1310389A (en) 2001-08-29
CN1110754C CN1110754C (en) 2003-06-04

Family

ID=4576371

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 00102381 Expired - Fee Related CN1110754C (en) 2000-02-21 2000-02-21 Computer hard disk data copying method and system

Country Status (1)

Country Link
CN (1) CN1110754C (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003050683A1 (en) * 2001-08-31 2003-06-19 Legend (Beijing) Limited Method for backing up and recovering data in the hard disk of a computer
CN100363902C (en) * 2002-06-14 2008-01-23 诺基亚公司 Warming large dynamic data in redundant functional unit
CN100421082C (en) * 2003-11-14 2008-09-24 国际商业机器公司 System, apparatus, and method for automatic copy function selection
CN101512493B (en) * 2006-10-06 2012-09-05 尼禄股份公司 Method and device for producing backup strategy for client
CN101645048B (en) * 2009-08-27 2013-09-11 公安部第三研究所 Method for realizing computer virtualized evidence obtaining
CN103842987A (en) * 2011-09-14 2014-06-04 网络存储技术公司 Method and system for using compression in partial cloning
CN103874979A (en) * 2011-12-08 2014-06-18 株式会社日立制作所 Remote copy system and remote copy control method
CN105373339A (en) * 2014-08-29 2016-03-02 深圳市金胜电子科技有限公司 Hard disk data copy method and system
CN107967118A (en) * 2016-10-19 2018-04-27 南京拓界信息技术有限公司 A kind of method and apparatus realized hard disc data high speed dump and checked
CN111813323A (en) * 2019-04-11 2020-10-23 北京汇天鸿佰科技有限公司 Film data copying system, method, terminal and storage medium

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0428108D0 (en) * 2004-12-23 2005-01-26 Ibm Storage system with multiple copy targeting

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003050683A1 (en) * 2001-08-31 2003-06-19 Legend (Beijing) Limited Method for backing up and recovering data in the hard disk of a computer
US7146525B2 (en) 2001-08-31 2006-12-05 Legend (Beijing) Limited Method for backing up and recovering data in the hard disk of a computer
CN100363902C (en) * 2002-06-14 2008-01-23 诺基亚公司 Warming large dynamic data in redundant functional unit
CN100421082C (en) * 2003-11-14 2008-09-24 国际商业机器公司 System, apparatus, and method for automatic copy function selection
CN101512493B (en) * 2006-10-06 2012-09-05 尼禄股份公司 Method and device for producing backup strategy for client
CN101645048B (en) * 2009-08-27 2013-09-11 公安部第三研究所 Method for realizing computer virtualized evidence obtaining
CN103842987A (en) * 2011-09-14 2014-06-04 网络存储技术公司 Method and system for using compression in partial cloning
CN103842987B (en) * 2011-09-14 2016-08-17 Netapp股份有限公司 The method and system of compression are used in part clone
CN103874979A (en) * 2011-12-08 2014-06-18 株式会社日立制作所 Remote copy system and remote copy control method
CN105373339A (en) * 2014-08-29 2016-03-02 深圳市金胜电子科技有限公司 Hard disk data copy method and system
CN105373339B (en) * 2014-08-29 2019-02-12 深圳市金胜电子科技有限公司 A kind of copy method and system of hard disc data
CN107967118A (en) * 2016-10-19 2018-04-27 南京拓界信息技术有限公司 A kind of method and apparatus realized hard disc data high speed dump and checked
CN111813323A (en) * 2019-04-11 2020-10-23 北京汇天鸿佰科技有限公司 Film data copying system, method, terminal and storage medium

Also Published As

Publication number Publication date
CN1110754C (en) 2003-06-04

Similar Documents

Publication Publication Date Title
CN1276427C (en) Information reproducing equipment, obtaining method and program for data management information and storage medium
CN1110754C (en) Computer hard disk data copying method and system
CN1144216C (en) Recording medium recorded with data structure and recording / reproducing method and equipment
CN1161754C (en) Data recording apparatus and method, data reproducing apparatus and method, data recording/reproducing apparatus and method and transmission medium
CN1682308A (en) Method and apparatus for adaptively allocating a spare area in a recording medium, and a recording medium having a spare area allocated using the same
US20100082537A1 (en) File system for storage device which uses different cluster sizes
CN101030146A (en) Method and system for updating fastener
CN1218237C (en) System for and method of accessing blocks on storage medium
TW440766B (en) The data copy method and system of computer hard disks
CN1968386A (en) Recording apparatus and method
CN1190779A (en) Information file recording method and device thereof
CN1842866A (en) Information recording method and information recording apparatus for recording medium
CN1627421A (en) Method and appts. for conversion of file system format
CN1447242A (en) Control device suitable to quick flash memory card and its construction methods
CN1848280A (en) Recording device
CN1945519A (en) Storage control apparatus and storage control method
CN1154941C (en) Data transfer method and apparatus
CN1508795A (en) Data storage method for hard disk for camera-shooting and recording device
CN1529843A (en) Method and system for reducing fragmentation
CN101078972A (en) Data storing device and data access method
CN1991833A (en) File system and file information processing method
CN1950813A (en) Storage medium storing application data providing programming function, and apparatus and method for reproducing the application
CN1269034C (en) Compression of executable document in embedded type system and its loading method
CN1215412C (en) Disc medium managing method
KR20080018805A (en) Multimedia system framework having layer consolidating access to multiple media devices

Legal Events

Date Code Title Description
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C06 Publication
PB01 Publication
C14 Grant of patent or utility model
GR01 Patent grant
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Zhang Zhihua

Inventor before: Lin Guangxin

Inventor before: Chen Xuantong

Inventor before: Zhou Hongxi

Inventor before: Shi Yongjun

TR01 Transfer of patent right

Effective date of registration: 20170915

Address after: No. 23, Liu Liu village, Liu Ying Wu Township, Ningjin County, Dezhou, Shandong

Patentee after: Zhang Zhihua

Address before: Taipei City, Taiwan, China

Patentee before: Inventec Corporation

TR01 Transfer of patent right
CP02 Change in the address of a patent holder

Address after: No. 247 lililiu Road, lylii Town, Li Riverside County, the Guangxi Zhuang Autonomous Region, the Guangxi Zhuang Autonomous Region

Patentee after: Zhang Zhihua

Address before: No. 23, West Liu village, Liu Ying Township, Ningjin County, Dezhou, Shandong

Patentee before: Zhang Zhihua

CP02 Change in the address of a patent holder
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20030604

Termination date: 20180221

CF01 Termination of patent right due to non-payment of annual fee