CN109471589A - Intelligent disc recombination method and intelligent disc recombination system - Google Patents
Intelligent disc recombination method and intelligent disc recombination system Download PDFInfo
- Publication number
- CN109471589A CN109471589A CN201710800612.2A CN201710800612A CN109471589A CN 109471589 A CN109471589 A CN 109471589A CN 201710800612 A CN201710800612 A CN 201710800612A CN 109471589 A CN109471589 A CN 109471589A
- Authority
- CN
- China
- Prior art keywords
- file
- recombination
- weight
- disk
- disc
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
- G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0635—Configuration or reconfiguration of storage systems by changing the path, e.g. traffic rerouting, path reconfiguration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0689—Disk arrays, e.g. RAID, JBOD
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Debugging And Monitoring (AREA)
Abstract
The present invention provides a kind of intelligent disc recombination method and intelligent disc recombination system.The intelligent disc recombination method is for recombinating a disk, the several files of the disc storage.The intelligent disc recombination method the following steps are included: record each file a number of calls and nearest call time；According to the number of calls of each file and nearest call time, a weight is calculated；According to weight, recombination sequence is obtained；Disk is recombinated according to recombination sequence.The present invention is using the foundation of recombination sequence and the technology of compression/de-compression, so that the disk after recombination has more access efficiency.
Description
Technical field
The present invention relates to a kind of recombination method and recombination system more particularly to a kind of intelligent disc recombination methods and Intelligent magnetic
Disk recombination system.
Background technique
With flourishing for computer technology, PC and commercial computer have be unable to do without people's lives.It has sent out at present
Miscellaneous program is put on display, to perform various functions.However, computer, after prolonged use, disk may fill up
Various programs and file.In computer operation, it is necessary to be accessed from mixed and disorderly data, and influence computer and execute efficiency.
Summary of the invention
The present invention provides a kind of intelligent disc recombination method and intelligent disc recombination system, utilizes the foundation of recombination sequence
And the technology of compression/de-compression, so that the disk after recombination has more access efficiency.
The present invention proposes a kind of intelligent disc recombination method, for recombinating a disk, the several files of the disc storage.The intelligence
Can disk recombination method the following steps are included: record each file a number of calls and nearest call time；According to each text
The number of calls of part and nearest call time calculate a weight；According to weight, recombination sequence is obtained；Disk is suitable according to recombinating
Sequence is recombinated.
The present invention also proposes a kind of intelligent disc recombination method, for recombinating a disk, the several files of the disc storage.It should
Intelligent disc recombination method is the following steps are included: compressing these files is several compressed files, and stores these and compressed text
Part is in an apparatus for temporary storage；One data scrubbing program is carried out to disk；Decompressing these, compressed file is to disk, so that these are literary
Part is reconstituted in disk.
The present invention also proposes a kind of intelligent disc recombination system, for recombinating a disk, the several files of the disc storage.It should
Intelligent disc recombination system includes a call statistics unit, a weight calculation unit and one point of group unit；Call statistics unit is used
In the number of calls and nearest call time that record each file；Weight calculation unit is used for the calling time according to each file
Several and nearest call time calculates a weight；Group unit is divided to be used to obtain recombination sequence according to weight；Disk is according to recombination
Sequence is recombinated.
Detailed description of the invention
Fig. 1 is the schematic diagram according to the intelligent disc recombination system of an embodiment.
Fig. 2 is the flow chart according to the intelligent disc recombination method of an embodiment.
Fig. 3 is an example of the call case of several files.
Fig. 4 is another example of the call case of several files.
Fig. 5 is another example of the call case of several files
Fig. 6 is another example of the call case of several files.
Description of symbols:
100: intelligent disc recombination system；
110: call statistics unit；
120: weight calculation unit；
130: dependence inspection unit；
140: dividing group unit；
150: compression unit；
160: control unit；
170: decompression unit；
800: apparatus for temporary storage；
900: disk；
CN: the number of calls；
CP: enabling time length；
CT: nearest call time；
RR: dependence；
S110, S120, S130, S140, S150, S160, S170, S180: step；
SQ: recombination sequence；
T1, T2, T3, T4, T5, T6: time point；
WT: weight.
Specific embodiment
To enable features described above and advantage of the invention to be clearer and more comprehensible, special embodiment below, and institute's attached drawing is cooperated to make
Detailed description are as follows.
Fig. 1 is please referred to, for according to the schematic diagram of the intelligent disc recombination system 100 of an embodiment, intelligent disc recombination
System 100 is, for example, a computer, an external electronic device or a cloud center.Intelligent disc recombination system 100 is exhaled including one
It is statistic unit 110, a weight calculation unit 120, a dependence inspection unit 130, one points of group units 140, compression units
150, a control unit 160 and a decompression unit 170.Call statistics unit 110, weight calculation unit 120, dependence inspection
Unit 130 divides group unit 140, compression unit 150, control unit 160 and decompression unit 170 to be, for example, a circuit, a circuit
The storage device of plate, a chip or storage arrays program code.
Intelligent disc recombination system 100 stores several files for recombinating a disk 900, disk 900.By making for a long time
With rear, the file stored by disk 900 is at random in each memory area, and seriously affects the efficiency of data access.The present embodiment
Intelligent disc recombination system 100 can be such that data continuously store, and the file with dependence can divide group to store, to improve
The efficiency of data access.The running of above-mentioned each item is described in detail in a flow chart of more arranging in pairs or groups below.
Referring to figure 2., for according to the flow chart of the intelligent disc recombination method of an embodiment.Firstly, in step S110
In, call statistics unit 110 takes out the call case of each file, the number of calls CN to record each file and calling recently
Time CT.In one embodiment, call statistics unit 110 can take out the call case of each file, or calling from LOG grades
The mode intercepted immediately can also be used in statistic unit 110, intercepts the calling of each file.For example, referring to figure 3.,
For an example of the call case of several files.As shown in figure 3, time point T1 is the time recombinated last time, time point T2
It is the time specifically recombinated.In time point T1 between time point T2, open within OUTLOOK main program 24 hours, WORD master
Program is then that enabling per week is primary, and LINE main program is then After Hours to be shut off.Call statistics unit 110 can call these
Number CN and nearest call time CT are recorded.
Then, in the step s 120, when weight calculation unit 120 is according to the number of calls of each file and calling recently
Between, calculate a weight WT.In one embodiment, weight WT is ratio (the i.e. weight of number of calls CN and nearest call time CT).For example, the number of calls 3, nearest call time were before 2 days, then weight is 3/2；Calling
Number is 5, and nearest call time was before 1 day, then weight is 5/1.
Then, in step s 130, dependence inspection unit 130 analyzes a dependence RR of these files.For example,
When dependence inspection unit 130 searches the process tree of Mcafee, it can be found that the parent process of McCSPServiceHost.exe is
Service.exe.Tracing up again and the parent process of Service.exe can be obtained is Winit.exe, the parent process of Winit.exe
For smss.exe.Service.exe, Winit.exe and smss.exe are all the built-in program of Windows10 operating system.Operation
Internal system is called layer by layer by this path, final calling to the McCSPServiceHost. in Mcafee program
exe.This series winding relationship is dependence RR.
Illustrate as another example, the parent process of DOC file is WORD main program, and the parent process of XLS file is the main journey of EXCEL
Sequence, the parent process of html file are IE main program, and so on.
Then, in step S140, group unit 140 is divided to obtain a recombination sequence SQ.In one embodiment, divide group unit
140, according to the weight WT of these files, obtain recombination sequence SQ.That is, the higher person of weight WT, recombination sequence SQ more before
Face.Alternatively, in another embodiment, dividing group unit 140 that can be recombinated according to the weight WT and dependence RR of these files
Sequence SQ.That is, several files with dependence RR can succeedingly sort together.Alternatively, in another embodiment
In, divide weight WT, enabling time length CP and dependence RR of the group unit 140 according to these files, obtains recombination sequence SQ.?
That is group unit 140 is divided, by enabling time length CP compared with elder, can to sort in recombination sequence SQ when weight WT is identical
Compared with the order of front.
By taking Fig. 3 as an example, LINE main program and OUTLOOK are activated daily, and WORD main program is per week to be enabled once.
LINE main program is After Hours shut off, OUTLOOK main program is then that 24 hours whole days open.The weight WT of OUTLOOK main program
Greater than the weight WT that the weight WT of weight WT, the LINE main program of LINE main program is greater than WORD main program.Therefore, suitable in recombination
In sequence SQ, operating system makes number one, and is then then OUTLOOK main program, LINE main program, WORD main program.
It referring to figure 4., is another example of the call case of several files.Time point T3 be recombinated last time when
Between, time point T4 is the time specifically recombinated.In time point T3 between time point T4, DOC file each week is opened
Once, XLS file is opened once every three days, and html file can all be opened daily.This three is all annexed document, all there is main program
Calling, respectively WORD main program, EXCEL main program and IE main program.DOC file, XLS file, html file are activated
Frequency also and then influences the utilization rate of WORD main program, EXCEL main program and IE main program.Therefore, in recombination sequence SQ,
Collating sequence are as follows: operating system, IE main program, html file, EXCEL main program, XLS file, WORD main program, DOC file.
It referring to figure 5., is another example of the call case of several files.Time point T5 be recombinated last time when
Between, time point T6 is the time specifically recombinated.In time point T5 between time point T6, video driver enters one
System will be activated, until system closedown is just terminated.Antivirus software is activated once into operating system, and in system
It can just be terminated when shutdown.IE main program can all enable daily, but can just open, before system closedown after for a period of time into system
A few minutes will be switched off.For this example, video driver and antivirus software, utilization rate, can as using the time
It is so that starting and termination time, sequencing must be measured for system, it is however generally that, video driver is due to collocation
Hardware relationship, must be longer than antivirus software using the time.This three is to use daily, therefore weight WT is identical, but enable
Time span CP is then different.Therefore, recombination sequence SQ sequence is as follows: operating system, video driver, antivirus software, IE
Main program.
Fig. 6 is please referred to, is another example of the call case of several files.In this example, weight calculation unit 120
Calculate weight WT only for A_DOC file, B_DOC file, C_XLS file and D_XLS file, and not to WORD main program and
EXCEL main program calculates weight WT.The weight WT of A_DOC file is that the weight WT of 3, B_DOC file is the power of 2, C_XLS file
Weight WT is that the weight of 0.5, D_XLS file is 2.5.The weight WT of the weight WT of the weight WT of A_DOC file is maximum, according to different
Property RR, together by WORD main program and A_DOC file arrangements.Weight WT times of D_XLS file is high, will according to diversity RR
EXCEL main program and D_XLS file arrangements are together.Therefore, recombination sequence SQ sequence it is as follows: operating system, WORD main program,
A_DOC file, EXCEL main program, D_XLS file, B_DOC file, C_XLS file.
Then, in step S150, it is several compressed files that compression unit 150, which compresses these files,.These have been compressed
File storage is in apparatus for temporary storage 800.
Then, in step S160, compression unit 150 arranges these compressed files according to recombination sequence SQ.It is real one
It applies in example, directly compressed file can be numbered according to recombination sequence SQ, and these compressed files need not be moved.
Then, in step S170,160 order disk 900 of control unit carries out a data scrubbing program, e.g. format
Change program.
Then, in step S180, decompression unit 170 according to recombination sequence SQ decompress these compressed file to magnetic
Disk 900, so that these files are reconstituted in disk 900 according to recombination sequence SQ.
In this way, which the disk 900 after recombinating does not have data slit, and pass through the foundation of recombination sequence SQ, enables
Frequency is higher, and person is closer from operating system, increases the access speed of most of files.And the data of dependence RR high can store up
There are near, main program can be accessed rapidly with subsidiary file.
Although so it is not intended to limit the present invention in conclusion the present invention is disclosed above with embodiment.Institute of the present invention
Belong to those of ordinary skill in technical field, without departing from the spirit and scope of the present invention, when can be used for a variety of modifications and variations.
Therefore, protection scope of the present invention is when being subject to those as defined in claim.
Claims (12)
1. a kind of intelligent disc recombination method, for recombinating a disk, the multiple files of disc storage, the intelligent disc weight
Group method include:
Record each file a number of calls and nearest call time；
According to the number of calls of each file and the nearest call time, a weight is calculated；And
According to the weight, recombination sequence is obtained, the disk is recombinated according to the recombination sequence.
2. intelligent disc recombination method according to claim 1, which is characterized in that further include:
Compressing the file is multiple compressed files；
The compressed file is arranged according to the recombination sequence；
One data scrubbing program is carried out to the disk；And
According to compressed file is to the disk described in the recombination sequence decompression, so that the file is reconstituted in the magnetic
Disk.
3. intelligent disc recombination method according to claim 2, which is characterized in that in the step of compressing the file,
The compressed file is stored in an apparatus for temporary storage.
4. intelligent disc recombination method according to claim 1, which is characterized in that the weight be the number of calls with
The ratio of the nearest call time.
5. intelligent disc recombination method according to claim 1, which is characterized in that further include:
Analyze a dependence of the file；
Wherein in the step of obtaining the recombination sequence, also according to the dependence of the file, it is suitable to obtain the recombination
Sequence.
6. intelligent disc recombination method according to claim 1, which is characterized in that in the step of obtaining the recombination sequence
In, also according to an enabling time length of each file, obtain the recombination sequence.
7. a kind of intelligent disc recombination system, for recombinating a disk, the multiple files of disc storage, the intelligent disc weight
Group system include:
One call statistics unit, for record each file a number of calls and nearest call time；
One weight calculation unit, for according to each file the number of calls and the nearest call time, calculate one
Weight；And
One point of group unit, for obtaining recombination sequence according to the weight, the disk carries out weight according to the recombination sequence
Group.
8. intelligent disc recombination system according to claim 7, which is characterized in that further include:
One compression unit is multiple compressed files for compressing the file, and the compression unit is suitable also according to the recombination
The sequence arrangement compressed file；
One control unit, for ordering the disk to carry out a data scrubbing program；And
One decompression unit is used for according to compressed file is to the disk described in the recombination sequence decompression, so that described
File is reconstituted in the disk.
9. intelligent disc recombination system according to claim 8, which is characterized in that the compression unit has been compressed described
File storage is in an apparatus for temporary storage.
10. intelligent disc recombination system according to claim 7, which is characterized in that the weight is the number of calls
With the ratio of the nearest call time.
11. intelligent disc recombination system according to claim 7, which is characterized in that further include:
One dependence inspection unit, it is described to divide group unit also according to the file for analyzing a dependence of the file
The dependence obtains the recombination sequence.
12. intelligent disc recombination system according to claim 7, which is characterized in that the call statistics unit also records
One enabling time length of each file, each enabling time length for dividing group unit also according to each file,
Obtain the recombination sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710800612.2A CN109471589A (en) | 2017-09-07 | 2017-09-07 | Intelligent disc recombination method and intelligent disc recombination system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710800612.2A CN109471589A (en) | 2017-09-07 | 2017-09-07 | Intelligent disc recombination method and intelligent disc recombination system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109471589A true CN109471589A (en) | 2019-03-15 |
Family
ID=65657564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710800612.2A Withdrawn CN109471589A (en) | 2017-09-07 | 2017-09-07 | Intelligent disc recombination method and intelligent disc recombination system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109471589A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101714143A (en) * | 2008-10-08 | 2010-05-26 | 英业达股份有限公司 | Manufacturing method of mapping files and sorting method of file systems |
| CN102968324A (en) * | 2012-11-30 | 2013-03-13 | 北京奇虎科技有限公司 | Method and device for organizing booting files of computer system |
| CN103631971A (en) * | 2013-12-20 | 2014-03-12 | 北京奇虎科技有限公司 | Recombining method and device for transplantable executive file |
| CN105117169A (en) * | 2015-08-20 | 2015-12-02 | 浪潮(北京)电子信息产业有限公司 | Optimized disk space management method and apparatus |
-
2017
- 2017-09-07 CN CN201710800612.2A patent/CN109471589A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101714143A (en) * | 2008-10-08 | 2010-05-26 | 英业达股份有限公司 | Manufacturing method of mapping files and sorting method of file systems |
| CN102968324A (en) * | 2012-11-30 | 2013-03-13 | 北京奇虎科技有限公司 | Method and device for organizing booting files of computer system |
| CN103631971A (en) * | 2013-12-20 | 2014-03-12 | 北京奇虎科技有限公司 | Recombining method and device for transplantable executive file |
| CN105117169A (en) * | 2015-08-20 | 2015-12-02 | 浪潮(北京)电子信息产业有限公司 | Optimized disk space management method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8849798B2 (en) | Sampling analysis of search queries | |
| CN110413488B (en) | Server utilization rate early warning method and device | |
| CN102708183B (en) | Method and device for data compression | |
| CN106020722A (en) | Method, device and system for deduplication of repeated data of cloud storage system | |
| US11249987B2 (en) | Data storage in blockchain-type ledger | |
| CN105005585A (en) | Log data processing method and device | |
| CN105872731A (en) | Data processing method and device | |
| CN110909263B (en) | Method and device for determining companion relationship of identity characteristics | |
| CN109471589A (en) | Intelligent disc recombination method and intelligent disc recombination system | |
| CN108989088B (en) | Log uploading method and communication equipment | |
| CN106970837B (en) | Information processing method and electronic equipment | |
| TWI646424B (en) | Smart defrag method and smart defrag system | |
| CN115344633A (en) | Data processing method, device, equipment and storage medium | |
| CN111158994B (en) | Method and device for testing pressing performance | |
| CN105718485B (en) | A kind of method and device by data inputting database | |
| CN114511330A (en) | Improved CNN-RF-based Ethernet workshop Pompe deception office detection method and system | |
| CN109299112B (en) | Method and apparatus for processing data | |
| CN112416945A (en) | Data processing method and system based on big data platform and computer equipment | |
| CN104391916A (en) | GPEH data analysis method and device based on distributed computing platform | |
| CN111274203A (en) | Call bill storage system and method | |
| CN113297224B (en) | Mass data classification storage method and system based on Redis | |
| CN110909262B (en) | Method and device for determining companion relationship of identity information | |
| CN117331919B (en) | Database joint query method and device, electronic equipment and storage medium | |
| CN111144509B (en) | Method, device and computer for classifying system application programs | |
| CN105426377A (en) | Data management method, apparatus and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190315 |