CN105892939A - Information processing method and electronic equipment - Google Patents
Information processing method and electronic equipment Download PDFInfo
- Publication number
- CN105892939A CN105892939A CN201610184660.9A CN201610184660A CN105892939A CN 105892939 A CN105892939 A CN 105892939A CN 201610184660 A CN201610184660 A CN 201610184660A CN 105892939 A CN105892939 A CN 105892939A
- Authority
- CN
- China
- Prior art keywords
- memory area
- eigenvalue
- territory
- memory
- target storage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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
-
- 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/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
-
- 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
Abstract
Embodiments of the invention provide an information processing method and electronic equipment, and aim at improving the SSD recovery efficiency. The method comprises the following steps: acquiring parameters of at least two storage areas in a solid-state hard disk; acquiring characteristic values of the at least two storage areas on the basis of at least two parameters; determining the storage area which satisfies a first predetermined condition in the at least two storage areas as a target storage area on the basis of at least two characteristic values; carrying out garbage recovery on the target storage area.
Description
Technical field
The present invention relates to field of storage mediums, particularly relate to a kind of information processing method and electronic equipment.
Background technology
The quantity that SSD (solid state hard disc, Solid State Drives) is in idle period and free block is low
Actively garbage reclamation will be carried out in time setting threshold value.In prior art, when carrying out active garbage reclamation, SSD
Firmware needs to carry out SSD dish scan full hard disk, and then finds the block meeting garbage reclamation condition, is i.e. injured
Block, finally carries out garbage reclamation to block of being injured.
But, when carrying out actively garbage reclamation every time, scan full hard disk will be carried out, cause actively rubbish
The efficiency reclaimed is low.
Summary of the invention
The embodiment of the present application provides a kind of information processing method and electronic equipment, is used for improving SSD and reclaims
Efficiency.
First aspect, this application provides a kind of information processing method, including:
Obtain the parameter of at least two memory area in solid state hard disc；
Based on the eigenvalue of at least two memory area described at least two gain of parameter；
Based at least two eigenvalue, determine and described at least two memory area meets the first predetermined condition
Memory area be territory, target storage；
To territory, described target storage performs garbage reclamation.
Optionally, based at least two eigenvalue, determine and described at least two memory area meets first
The memory area of predetermined condition is territory, target storage, including:
Based on described at least two eigenvalue, determine the incidence relation between described at least two memory area；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region.
Optionally, based on described at least two eigenvalue, determine between described at least two memory area
Incidence relation, including:
Described at least two eigenvalue is ranked up；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region, including:
If described sequence is incremented by, it is determined that be arranged in the memory block that last predetermined number eigenvalue is corresponding
Territory is territory, described target storage；
If described sequence is successively decreased, it is determined that be arranged in the memory block that the most front predetermined number eigenvalue is corresponding
Territory is territory, described target storage.
Optionally, obtain the parameter of at least two memory area in solid state hard disc, including:
Obtain each memory area place memory element write number of times, each memory area write number of times,
The erasing times of each memory area, each memory area place memory element in effectively store sub-district
Effectively storage subregion quantity in territory quantity, and each memory area.
Optionally, described method also includes:
When the data variation of the first memory area of described at least two memory area, regain described
The eigenvalue of the first memory area.
Optionally, after performing garbage reclamation in territory, described target storage, also include:
Judge described solid state hard disc being performed, whether garbage reclamation meets the second predetermined condition；
When described solid state hard disc execution garbage reclamation meets described second predetermined condition, to described at least two
Individual memory area performs garbage reclamation.
Second aspect, this application provides a kind of electronic equipment, including:
Parameter acquisition module, for obtaining the parameter of at least two memory area in solid state hard disc；
Eigenvalue obtains module, for based at least two memory area described at least two gain of parameter
Eigenvalue；
Determine module, for based at least two eigenvalue, determine described at least two memory area fullness in the epigastrium and abdomen
The memory area of foot the first predetermined condition is territory, target storage；
First performs module, for performing garbage reclamation in territory, described target storage.
Optionally, described determine module for based on described at least two eigenvalue, determine described at least two
Incidence relation between individual memory area；Determine that described incidence relation meets described first sub-predetermined condition
Memory area is territory, described target storage.
Optionally, described determine that module is for being ranked up described at least two eigenvalue；If described row
Sequence is incremented by, it is determined that being arranged in memory area corresponding to last predetermined number eigenvalue is described target
Memory area；If described sequence is successively decreased, it is determined that be arranged in the most front predetermined number eigenvalue corresponding
Memory area is territory, described target storage.
Optionally, described parameter acquisition module is for obtaining writing of the memory element at each memory area place
Number of times, each memory area write number of times, the erasing times of each memory area, each memory area institute
Memory element in effectively storage subregion quantity, and each memory area in effectively store son
Region quantity.
Optionally, described eigenvalue acquisition module is additionally operable to when the first of described at least two memory area is deposited
During the data variation in storage area territory, regain the eigenvalue of described first memory area.
Optionally, described electronic equipment also includes:
Judge module, after performing garbage reclamation, it is judged that to institute in territory, described target storage
State solid state hard disc and perform whether garbage reclamation meets the second predetermined condition；
Second performs module, for meeting described second predetermined bar when described solid state hard disc performs garbage reclamation
During part, described at least two memory area is performed garbage reclamation.
Said one in the embodiment of the present application or multiple technical scheme, at least have following one or more
Technique effect:
In the technical scheme of the embodiment of the present application, first, at least two memory block in solid state hard disc is obtained
The parameter in territory, is then based on the eigenvalue of at least two gain of parameter at least two memory area.Then,
Based at least two eigenvalue, determine the memory block meeting the first predetermined condition at least two memory area
Territory is territory, target storage, finally to performing garbage reclamation in territory, target storage.So, the application is real
Executing eigenvalue based at least two memory area in example, by meeting, the first pre-conditioned eigenvalue is corresponding
Memory area be defined as territory, target storage, and then the territory, target storage determined carried out rubbish return
Receive.Owing to being made without scan full hard disk, and obtain the parameter of memory area and eigenvalue and scan full hard disk
Compare the most more rapid, so, solve the inefficient technical problem of prior art SSD garbage reclamation, real
Show the technique effect improving garbage reclamation efficiency.
Accompanying drawing explanation
Fig. 1 is the information processing method flow chart in the embodiment of the present application；
Fig. 2 is the electronic devices structure schematic diagram in the embodiment of the present application.
Detailed description of the invention
The embodiment of the present application provides a kind of information processing method and electronic equipment, is used for improving SSD and reclaims
Efficiency.
In order to solve above-mentioned technical problem, the technical scheme general thought that the application provides is as follows:
In the technical scheme of the embodiment of the present application, first, at least two memory block in solid state hard disc is obtained
The parameter in territory, is then based on the eigenvalue of at least two gain of parameter at least two memory area.Then,
Based at least two eigenvalue, determine the memory block meeting the first predetermined condition at least two memory area
Territory is territory, target storage, finally to performing garbage reclamation in territory, target storage.So, the application is real
Executing eigenvalue based at least two memory area in example, by meeting, the first pre-conditioned eigenvalue is corresponding
Memory area be defined as territory, target storage, and then the territory, target storage determined carried out rubbish return
Receive.Owing to being made without scan full hard disk, and obtain the parameter of memory area and eigenvalue and scan full hard disk
Compare the most more rapid, so, solve the inefficient technical problem of prior art SSD garbage reclamation, real
Show the technique effect improving garbage reclamation efficiency.
Below by accompanying drawing and specific embodiment, technical solution of the present invention is described in detail, it should reason
The specific features solved in the embodiment of the present application and embodiment is to technical scheme specifically
Bright rather than restriction to technical scheme, in the case of not conflicting, the embodiment of the present application with
And the technical characteristic in embodiment can be mutually combined.
The terms "and/or", a kind of incidence relation describing affiliated partner, expression can be deposited
In three kinds of relations, such as, A and/or B, can represent: individualism A, there is A and B simultaneously,
Individualism B these three situation.It addition, character "/" herein, typically represent forward-backward correlation to as if
A kind of relation of "or".
The application first aspect provides a kind of information processing method, as it is shown in figure 1, implement for the application
The flow chart of information processing method in example.The method includes:
S101: obtain the parameter of at least two memory area in solid state hard disc；
S102: based on the eigenvalue of at least two memory area described at least two gain of parameter；
S103: based at least two eigenvalue, determine described at least two memory area meets first pre-
The memory area of fixed condition is territory, target storage；
S104: to performing garbage reclamation in territory, described target storage.
SSD in the embodiment of the present application, including at least two memory area, such as 1024 memory areas
Deng, the application is not particularly limited.Memory area in the embodiment of the present application specifically refers to SSD and performs rubbish
Rubbish reclaims a ultimate unit, such as block block.
Further, including again multiple storage subregion in each memory area, such as 1024 store sub-district
Territory.Further, each memory area belongs to a memory element, and a memory element includes multiple
Memory area.So, the SSD in the embodiment of the present application includes multiple memory element, each memory element
Including multiple memory areas, each memory area includes again multiple storage subregion.
In S101, electronic equipment obtains the parameter of at least two memory area, obtains at least two ginseng altogether
Number.Specifically, obtain the parameter of each memory area of SSD, and obtain phase from each memory area
Same parameter.Certainly, it is thus achieved that the parameter value of each memory area be not completely equivalent.Implementing
Cheng Zhong, S101 can specifically include:
Obtain each memory area place memory element write number of times, each memory area write number of times,
The erasing times of each memory area, each memory area place memory element in effectively store sub-district
Effectively storage subregion quantity in territory quantity, and each memory area.
Certainly, can also include each memory area further reads number of times, the wiping of each storage subregion
Except number of times etc., the application is not particularly limited.
It follows that in S102, eigenvalue based at least two gain of parameter at least two memory area.
Specifically, in the embodiment of the present application, the eigenvalue of a memory area is used for representing this memory area
Need to carry out the degree of garbage reclamation.SSD carries out presetting computing to parameter, and then obtains eigenvalue.
Representing for convenience, it is assumed that SSD includes N number of memory area, N is the integer more than or equal to 2,
I is any integer in 1 to N.Making eigenvalue is F, then F1, F2, F3 ..., FN depends on respectively
The eigenvalue of the 1st memory area of secondary expression, the eigenvalue of the 2nd memory area, the 3rd memory block
The eigenvalue in territory ... and the eigenvalue of n-th memory area.Making parameter again is t, then t1, t2, t3 ...,
Tn represents the parameter of the 1st memory area, the parameter of the 2nd memory area the most successively, deposits for the 3rd
The parameter in storage area territory ... and the parameter of n-th memory area.So,
Fi=f (ti), formula 1
Represent, carry out presetting computing f to parameter ti of i-th memory area, it is thus achieved that i-th memory area
Eigenvalue Fi.
In the embodiment of the present application, according to the difference of parameter, it is thus achieved that the default computing f of eigenvalue is the most not
With.One of which will be enumerated below illustrate.During implementing, include but not limited to
In lower example.
The parameter of each memory area specifically include the memory element at each memory area place write number of times,
Each memory area write number of times, the erasing times of each memory area, the depositing of each memory area place
The effectively storage subregion number in effectively storage subregion quantity, and each memory area in storage unit
Amount.The eigenvalue of each memory area is calculated by formula 2.
Wherein, globalWriteiRepresent i-th memory area place memory element write number of times,
blockWriteiRepresent i-th memory area writes number of times, blockEraseiRepresent i-th memory area
Wiping number of times, GlobalValidPagesiRepresent effectively depositing in the memory element at i-th memory area place
Storage subregion quantity, BlockValidPagesiRepresent the effectively storage subregion number in i-th memory area
Amount.
Owing to eigenvalue represents that a memory area needs to carry out the degree of garbage reclamation, so it follows that
Based at least two eigenvalue, determine the territory, target storage needing to perform garbage reclamation.Specifically,
In S103, SSD, based at least two eigenvalue, determines that meeting first at least two memory area makes a reservation for
The memory area of condition is territory, target storage.
Specifically, in the embodiment of the present application, the process that implements of S103 includes:
Based on described at least two eigenvalue, determine the incidence relation between described at least two memory area；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region.
Specifically, the incidence relation in the embodiment of the present application is for representing that a memory area stores with other
The degree needing to carry out garbage reclamation is compared in region.First sub-predetermined condition represents a storage than other extremely
A few memory area more needs garbage reclamation.So, when incidence relation meets the first sub-predetermined condition
Time, determine that this memory area is territory, target storage.
In the embodiment of the present application, determine the incidence relation between at least two memory area, and determine
The implementation in territory, target storage has multiple.Wherein three kinds will be described in detail below.
The first:
In the first implementation, determine the pass of at least two memory area based at least two eigenvalue
Connection relation, particularly as follows: be characterized value to stamp the first label, for spy more than or equal to the memory area of preset value
Value indicative stamps, less than the memory area of preset value, the second label being different from the first label.For example, false
If preset value is 1.5, by the eigenvalue memory area tagged " 1 " more than or equal to 1.5, by eigenvalue
Memory area less than 1.5 is tagged " 0 ".
Owing to eigenvalue represents that memory area needs to perform the degree of garbage reclamation, so eigenvalue is the biggest,
Represent that memory area more needs to carry out garbage reclamation.Label is that the memory area eigenvalue of the first label is the biggest
In the memory area eigenvalue that label is the second label, so, the memory area of each the first label needs
The degree of garbage reclamation to be performed all is higher than the memory area of the second label.
Therefore, in the first implementation, the first son is pre-conditioned particularly as being the first label for label.
And then, the memory area of the first label is defined as territory, target storage.
The second:
In the second implementation, based on described at least two eigenvalue, determine that described at least two is deposited
Incidence relation between storage area territory, including:
Described at least two eigenvalue is ranked up；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region, including:
If described sequence is incremented by, it is determined that be arranged in the memory block that last predetermined number eigenvalue is corresponding
Territory is territory, described target storage；
If described sequence is successively decreased, it is determined that be arranged in the memory block that the most front predetermined number eigenvalue is corresponding
Territory is territory, described target storage.
Specifically, it is thus achieved that after the eigenvalue of each memory area, according to each eigenvalue size, by institute
Eigenvalue is had to be ranked up.In the embodiment of the present application, can be according to the order being incremented by successively to eigenvalue
It is ranked up, and then previous eigenvalue is less than or equal to later feature value；Can also be according to successively decreasing successively
Order eigenvalue is ranked up, and then previous eigenvalue is little equal to later feature value.
Further, if sequence is incremented by, then a memory area needs the degree carrying out garbage reclamation the highest
Other memory areas before eigenvalue is arranged in this memory area eigenvalue, after being arranged in less than eigenvalue
Other memory areas.So, when sequence is incremented by, determines and be arranged in last predetermined number eigenvalue
Corresponding memory area is territory, target storage.
As an example it is assumed that SSD includes 1024 memory areas, predetermined number is 10, then row
In the case of sequence is incremented by, determine in sequence the 1015th memory area that eigenvalue is corresponding, the 1016th
The memory area ... that eigenvalue is corresponding, the 1023rd memory area that eigenvalue is corresponding and the 1024th
The memory area that eigenvalue is corresponding is territory, target storage.
Or, if sequence is successively decreased, then a memory area needs the degree carrying out garbage reclamation to be lower than
Eigenvalue is arranged in other memory areas before this memory area eigenvalue, posterior higher than eigenvalue arrangement
Other memory areas.So, when sequence is successively decreased, it is determined that be arranged in the most front predetermined number eigenvalue
Corresponding memory area is territory, target storage.
As an example it is assumed that SSD includes 1024 memory areas, predetermined number is 10, then row
In the case of sequence is successively decreased, determine the 1st memory area that eigenvalue is corresponding, the 2nd eigenvalue in sequence
Corresponding memory area ..., the 9th memory area that eigenvalue is corresponding and the 10th eigenvalue are corresponding
Memory area is territory, target storage.
The third:
In the third implementation, based on described at least two eigenvalue, determine that described at least two is deposited
Incidence relation between storage area territory, including:
Described at least two eigenvalue is ranked up；
It is at least two grade by least two feature value division after sequence；Wherein, in previous grade
Each eigenvalue be all higher than equal to each eigenvalue in later grade, or previous grade
In each eigenvalue be respectively less than equal to each eigenvalue in later grade；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region, including:
From described at least two grade, determine that the eigenvalue that the grade of described eigenvalue maximum comprises is corresponding
Memory area be territory, target storage；The quantity of the described eigenvalue in each grade is predetermined number.
The third implementation just repeats no more with the similarity of the second implementation.The third is real
Existing mode is with the difference of the second way, after being ranked up eigenvalue, is drawn by eigenvalue
It is divided into multiple grade.In each grade, the quantity of eigenvalue is predetermined number.
So, if sequence is incremented by, the eigenvalue in the most previous grade is respectively less than equal in later grade
Eigenvalue, and then after memory area corresponding to previous grade needs the degree carrying out garbage reclamation to be less than
The memory area that one grade is corresponding.So, memory area corresponding to last grade needs most execution
Garbage reclamation, it is thus determined that memory area corresponding to last grade is territory, target storage.
As an example it is assumed that SSD includes 1024 memory areas, predetermined number is 32, then be incremented by
After arrangement, eigenvalue is divided successively 32 grades, be followed successively by Rank (1), Rank (2), Rank (3) ...,
Rank(31)、Rank(32).Then, it is determined that 32 eigenvalues in Rank (32) corresponding 32
Individual memory area is territory, target storage.
Similarly, if sequence is successively decreased, the eigenvalue in the most previous grade is all higher than equal to later grade
In eigenvalue, and then memory area corresponding to previous grade need the degree carrying out garbage reclamation to be higher than
The memory area that later grade is corresponding.So, determine that the memory area that first grade is answered is that target is deposited
Storage area territory.
As an example it is assumed that SSD includes 1024 memory areas, predetermined number is 32, then successively decrease
After arrangement, eigenvalue is in turn divided into Rank (1), Rank (2), Rank (3) ..., Rank (31),
Rank(32).Then, it is determined that 32 memory areas corresponding to 32 eigenvalues in Rank (1) are
Territory, target storage.
During implementing, the application those of ordinary skill in the field can select according to reality
Select in above-mentioned three kinds of implementations any one, or other implementations, the application does not do concrete limit
System.
Further, the predetermined number in the second implementation and the second implementation can be according to setting
Putting and the most actively change, such as predetermined number is fixed as 100.Or, it is also possible to move according to practical situation
State adjusts predetermined number.
Specifically, when SSD is chronically at idle condition, the speed producing rubbish is slower, it is therefore desirable to
The memory area performing garbage reclamation is the most less；And SSD short-term is when being in idle condition, produce rubbish
Speed, it is therefore desirable to the memory area performing garbage reclamation is also the most more.So, can be according to sky
The length of idle phase dynamically adjusts the value of predetermined number.
For example, when idle period is 5 minutes, predetermined number is adjusted to 32.And phase when idle
When being 60 minutes, predetermined number is adjusted to 4.8.
Finally, after determining territory, target storage, in S104, territory, target storage is performed rubbish and returns
Receive.
By foregoing description it can be seen that due to obtain memory area parameter, it is thus achieved that eigenvalue, Yi Jiji
The execution process in territory, target storage is determined in eigenvalue, more quick more than SSD being carried out scan full hard disk,
More save time, so, compared with prior art, the technical scheme in the embodiment of the present application achieves raising
The technique effect of garbage reclamation efficiency.
Further, in another embodiment of the application, also include:
When the data variation of the first memory area of described at least two memory area, regain described
The eigenvalue of the first memory area.
Specifically, the parameter of memory area can change with the data variation of memory area.Such as to depositing
Write after storage area territory writes data, the erasing former data of memory area in new data or erasing memory area
Data etc., all can cause Parameters variation.The Parameters variation of memory area, the eigenvalue of memory area enters
And also can change.So, in the embodiment of the present application, the first memory area at least two stores
During data variation, then regain the eigenvalue of the first memory area.Wherein, the first memory area be to
Few two memory areas occur arbitrary memory area of data variation.
When the data variation of the first memory area, recalculate the eigenvalue of the first memory area, and then
Electronic equipment is made can again to weigh the first memory block according to the data situation of the first memory area
Territory needs to carry out the degree of garbage reclamation, and then adjusts territory, target storage in time.
Further, in conjunction with first embodiment, after S104 performs garbage reclamation to territory, target storage, also
Including:
Judge described solid state hard disc being performed, whether garbage reclamation meets the second predetermined condition；
When described solid state hard disc execution garbage reclamation meets described second predetermined condition, to described at least two
Individual memory area performs garbage reclamation.
Specifically, the second predetermined condition is to represent the condition that SSD needs to perform scan full hard disk garbage reclamation.
During implementing, the second predetermined condition can specially perform the number of times of garbage reclamation and reach default
Number of times, or for reaching preset duration etc. apart from the duration of last scan full hard disk garbage reclamation, the application
It is not particularly limited.
When SSD execution garbage reclamation meets the second predetermined condition, represent that SSD is according to above-described embodiment
In scheme repeatedly or for a long time perform garbage reclamation.Owing to carrying out rubbish according to the mode in above-described embodiment
Rubbish reclaims, and the memory area that eigenvalue is the least is difficult to be recovered rubbish, so when SSD garbage reclamation
When meeting the second predetermined condition, SSD is performed scan full hard disk, and then at least two memory area is performed
Garbage reclamation.
By foregoing description it can be seen that when SSD perform garbage reclamation meet the second predetermined condition time, to SSD
Perform scan full hard disk, so that the memory area that be there is a need to perform garbage reclamation is performed garbage reclamation.Therefore,
Avoid one or more memory area to be difficult to owing to eigenvalue is the least be performed garbage reclamation.
Based on the inventive concept as information processing method in previous embodiment, the application second aspect is also
A kind of electronic equipment is provided.During implementing, the SSD that electronic equipment is the most independent, or
Being provided with the equipment of SSD, the application is not particularly limited.As in figure 2 it is shown, this electronic equipment includes:
Parameter acquisition module 201, for obtaining the parameter of at least two memory area in solid state hard disc；
Eigenvalue obtains module 202, for based at least two memory area described at least two gain of parameter
Eigenvalue；
Determine module 203, for based at least two eigenvalue, determine in described at least two memory area
The memory area meeting the first predetermined condition is territory, target storage；
First performs module 204, for performing garbage reclamation in territory, described target storage.
Specifically, determine module 203 for based on described at least two eigenvalue, determine described at least
Incidence relation between two memory areas；Determine that described incidence relation meets described first sub-predetermined condition
Memory area be territory, described target storage.
Further, determine that module 203 is for being ranked up described at least two eigenvalue；If it is described
Sequence is incremented by, it is determined that being arranged in memory area corresponding to last predetermined number eigenvalue is described mesh
Mark memory area；If described sequence is successively decreased, it is determined that be arranged in the most front predetermined number eigenvalue corresponding
Memory area be territory, described target storage.
In the embodiment of the present application, parameter acquisition module 201 is for obtaining depositing of each memory area place
Storage unit write number of times, each memory area write number of times, the erasing times of each memory area, each
In effectively storage subregion quantity, and each memory area in the memory element at memory area place
Effectively storage subregion quantity.
Further, eigenvalue acquisition module is additionally operable to when the first memory block of described at least two memory area
During the data variation in territory, regain the eigenvalue of described first memory area.
Further, described electronic equipment also includes:
Judge module, after performing garbage reclamation, it is judged that to institute in territory, described target storage
State solid state hard disc and perform whether garbage reclamation meets the second predetermined condition；
Second performs module, for meeting described second predetermined bar when described solid state hard disc performs garbage reclamation
During part, described at least two memory area is performed garbage reclamation.
Various variation patterns and the instantiation of the information processing method in earlier figures 1 embodiment are equally applicable
In the electronic equipment of the present embodiment, by the aforementioned detailed description to information processing method, art technology
Personnel are it is clear that the implementation of electronic equipment in the present embodiment, so for the letter of description
Clean, it is not described in detail in this.
Said one in the embodiment of the present application or multiple technical scheme, at least have following one or more
Technique effect:
In the technical scheme of the embodiment of the present application, first, at least two memory block in solid state hard disc is obtained
The parameter in territory, is then based on the eigenvalue of at least two gain of parameter at least two memory area.Then,
Based at least two eigenvalue, determine the memory block meeting the first predetermined condition at least two memory area
Territory is territory, target storage, finally to performing garbage reclamation in territory, target storage.So, the application is real
Executing eigenvalue based at least two memory area in example, by meeting, the first pre-conditioned eigenvalue is corresponding
Memory area be defined as territory, target storage, and then the territory, target storage determined carried out rubbish return
Receive.Owing to being made without scan full hard disk, and obtain the parameter of memory area and eigenvalue and scan full hard disk
Compare the most more rapid, so, solve the inefficient technical problem of prior art SSD garbage reclamation, real
Show the technique effect improving garbage reclamation efficiency.
Those skilled in the art it should be appreciated that embodiments of the invention can be provided as method, system or
Computer program.Therefore, the present invention can use complete hardware embodiment, complete software implementation,
Or combine the form of embodiment in terms of software and hardware.And, the present invention can use one or more
The computer-usable storage medium wherein including computer usable program code (includes but not limited to disk
Memorizer, CD-ROM, optical memory etc.) form of the upper computer program implemented.
The present invention is with reference to method, equipment (system) and computer program product according to embodiments of the present invention
The flow chart of product and/or block diagram describe.It should be understood that can be by computer program instructions flowchart
And/or the flow process in each flow process in block diagram and/or square frame and flow chart and/or block diagram
And/or the combination of square frame.Can provide these computer program instructions to general purpose computer, special-purpose computer,
The processor of Embedded Processor or other programmable data processing device is to produce a machine so that logical
The instruction of the processor execution crossing computer or other programmable data processing device produces for realizing at stream
The function specified in one flow process of journey figure or multiple flow process and/or one square frame of block diagram or multiple square frame
Device.
These computer program instructions may be alternatively stored in and computer or the process of other programmable datas can be guided to set
In the standby computer-readable memory worked in a specific way so that be stored in this computer-readable memory
In instruction produce and include the manufacture of command device, this command device realize in one flow process of flow chart or
The function specified in multiple flow processs and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device,
Make on computer or other programmable devices, perform sequence of operations step computer implemented to produce
Process, thus the instruction performed on computer or other programmable devices provides for realizing at flow chart
The step of the function specified in one flow process or multiple flow process and/or one square frame of block diagram or multiple square frame
Suddenly.
Specifically, the computer program instructions that a kind of information processing method in the embodiment of the present application is corresponding
Can be stored in CD, hard disk, on the storage medium such as USB flash disk, when believing with the first in storage medium
When breath computer program instructions corresponding to processing method is read by an electronic equipment or be performed, including as follows
Step:
Obtain the parameter of at least two memory area in solid state hard disc；
Based on the eigenvalue of at least two memory area described at least two gain of parameter；
Based at least two eigenvalue, determine and described at least two memory area meets the first predetermined condition
Memory area be territory, target storage；
To territory, described target storage performs garbage reclamation.
Optionally, in described storage medium storage with step based at least two eigenvalue, determine described
The memory area meeting the first predetermined condition at least two memory area is territory, target storage, corresponding
Computer instruction, during being specifically performed, specifically includes following steps:
Based on described at least two eigenvalue, determine the incidence relation between described at least two memory area；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region.
Optionally, in described storage medium storage with step based on described at least two eigenvalue, determine
Incidence relation between described at least two memory area, corresponding computer instruction had specifically been performed
Cheng Zhong, specifically includes following steps:
Described at least two eigenvalue is ranked up；
In described storage medium, with step, storage determines that described incidence relation meets described first sub predetermined bar
The memory area of part is territory, described target storage, corresponding computer instruction during being specifically performed,
Specifically include following steps:
If described sequence is incremented by, it is determined that be arranged in the memory block that last predetermined number eigenvalue is corresponding
Territory is territory, described target storage；
If described sequence is successively decreased, it is determined that be arranged in the memory block that the most front predetermined number eigenvalue is corresponding
Territory is territory, described target storage.
Optionally, store in described storage medium obtains at least two memory block in solid state hard disc with step
The parameter in territory, corresponding computer instruction, during being specifically performed, specifically includes following steps:
Obtain each memory area place memory element write number of times, each memory area write number of times,
The erasing times of each memory area, each memory area place memory element in effectively store sub-district
Effectively storage subregion quantity in territory quantity, and each memory area.
Optionally, in described storage medium, also storage has other computer instruction, and these computers refer to
Order comprises the steps: when being performed
When the data variation of the first memory area of described at least two memory area, regain described
The eigenvalue of the first memory area.
Optionally, in described storage medium, also storage has other computer instruction, and these computers refer to
Make with step: be performed, when executed after performing garbage reclamation in territory, described target storage
Comprise the steps:
Judge described solid state hard disc being performed, whether garbage reclamation meets the second predetermined condition；
When described solid state hard disc execution garbage reclamation meets described second predetermined condition, to described at least two
Individual memory area performs garbage reclamation.
Obviously, those skilled in the art can carry out various change and modification without deviating from this to the present invention
The spirit and scope of invention.So, if these amendments of the present invention and modification belong to right of the present invention and want
Ask and within the scope of equivalent technologies, then the present invention is also intended to comprise these change and modification.
Claims (12)
1. an information processing method, including:
Obtain the parameter of at least two memory area in solid state hard disc；
Based on the eigenvalue of at least two memory area described at least two gain of parameter；
Based at least two eigenvalue, determine and described at least two memory area meets the first predetermined condition
Memory area be territory, target storage；
To territory, described target storage performs garbage reclamation.
2. the method for claim 1, it is characterised in that based at least two eigenvalue, determine
The memory area meeting the first predetermined condition in described at least two memory area is territory, target storage, bag
Include:
Based on described at least two eigenvalue, determine the incidence relation between described at least two memory area；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region.
3. method as claimed in claim 2, it is characterised in that based on described at least two eigenvalue,
Determine the incidence relation between described at least two memory area, including:
Described at least two eigenvalue is ranked up；
Determining that described incidence relation meets the memory area of described first sub-predetermined condition is the storage of described target
Region, including:
If described sequence is incremented by, it is determined that be arranged in the memory block that last predetermined number eigenvalue is corresponding
Territory is territory, described target storage；
If described sequence is successively decreased, it is determined that be arranged in the memory block that the most front predetermined number eigenvalue is corresponding
Territory is territory, described target storage.
4. the method as described in any one of claim 1-3, it is characterised in that in acquisition solid state hard disc extremely
The parameter of few two memory areas, including:
Obtain each memory area place memory element write number of times, each memory area write number of times,
The erasing times of each memory area, each memory area place memory element in effectively store sub-district
Effectively storage subregion quantity in territory quantity, and each memory area.
5. method as claimed in claim 4, it is characterised in that described method also includes:
When the data variation of the first memory area of described at least two memory area, regain described
The eigenvalue of the first memory area.
6. the method for claim 1, it is characterised in that hold in territory, described target storage
After row garbage reclamation, also include:
Judge described solid state hard disc being performed, whether garbage reclamation meets the second predetermined condition；
When described solid state hard disc execution garbage reclamation meets described second predetermined condition, to described at least two
Individual memory area performs garbage reclamation.
7. an electronic equipment, including:
Parameter acquisition module, for obtaining the parameter of at least two memory area in solid state hard disc；
Eigenvalue obtains module, for based at least two memory area described at least two gain of parameter
Eigenvalue；
Determine module, for based at least two eigenvalue, determine described at least two memory area fullness in the epigastrium and abdomen
The memory area of foot the first predetermined condition is territory, target storage；
First performs module, for performing garbage reclamation in territory, described target storage.
8. electronic equipment as claimed in claim 7, it is characterised in that described determine module for based on
Described at least two eigenvalue, determines the incidence relation between described at least two memory area；Determine institute
State incidence relation meeting the memory area of described first sub-predetermined condition is territory, described target storage.
9. electronic equipment as claimed in claim 8, it is characterised in that described determine that module is for institute
State at least two eigenvalue to be ranked up；If described sequence is incremented by, it is determined that be arranged in last present count
The memory area that amount eigenvalue is corresponding is territory, described target storage；If described sequence is successively decreased, it is determined that
Being arranged in memory area corresponding to the most front predetermined number eigenvalue is territory, described target storage.
10. the electronic equipment as described in any one of claim 7-9, it is characterised in that described parameter acquiring
Module writes number of times, the writing time of each memory area for obtain the memory element at each memory area place
The erasing times of memory area several, each, each memory area place memory element in effective storage
Effectively storage subregion quantity in subregion quantity, and each memory area.
11. electronic equipments as claimed in claim 10, it is characterised in that described eigenvalue obtains module
It is additionally operable to, when the data variation of the first memory area of described at least two memory area, regain institute
State the eigenvalue of the first memory area.
12. electronic equipments as claimed in claim 7, it is characterised in that described electronic equipment also includes:
Judge module, after performing garbage reclamation, it is judged that to institute in territory, described target storage
State solid state hard disc and perform whether garbage reclamation meets the second predetermined condition；
Second performs module, for meeting described second predetermined bar when described solid state hard disc performs garbage reclamation
During part, described at least two memory area is performed garbage reclamation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610184660.9A CN105892939A (en) | 2016-03-28 | 2016-03-28 | Information processing method and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610184660.9A CN105892939A (en) | 2016-03-28 | 2016-03-28 | Information processing method and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105892939A true CN105892939A (en) | 2016-08-24 |
Family
ID=57013920
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610184660.9A Pending CN105892939A (en) | 2016-03-28 | 2016-03-28 | Information processing method and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105892939A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050044140A1 (en) * | 2003-08-21 | 2005-02-24 | Fujitsu Limited | Information processing method, information processing system, information processing apparatus and computer readable information recording medium |
| CN103902465A (en) * | 2014-03-19 | 2014-07-02 | 华为技术有限公司 | Method and system for recycling solid state disk junk and solid state disk controller |
| CN104866246A (en) * | 2015-06-05 | 2015-08-26 | 上海新储集成电路有限公司 | Solid state hybrid drive |
-
2016
- 2016-03-28 CN CN201610184660.9A patent/CN105892939A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050044140A1 (en) * | 2003-08-21 | 2005-02-24 | Fujitsu Limited | Information processing method, information processing system, information processing apparatus and computer readable information recording medium |
| CN103902465A (en) * | 2014-03-19 | 2014-07-02 | 华为技术有限公司 | Method and system for recycling solid state disk junk and solid state disk controller |
| CN104866246A (en) * | 2015-06-05 | 2015-08-26 | 上海新储集成电路有限公司 | Solid state hybrid drive |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE112010002663B4 (en) | Memory management systems, methods for improving write-erase persistence life of memory devices and computer program product | |
| US9122585B2 (en) | Method for managing data in storage device and memory system employing such a method | |
| CN105260696B (en) | Self-learning method and device of fingerprint template | |
| CN103136112B (en) | Flash memory storage array control method and flash memory | |
| CN104408163B (en) | A kind of data classification storage and device | |
| CN107291381B (en) | Method for realizing dynamic acceleration area of solid state disk and solid state disk | |
| CN105511806B (en) | The method and mobile terminal of processing write requests | |
| CN107092563B (en) | Garbage recovery method and device | |
| CN106527963A (en) | Memory system and host apparatus | |
| CN107957848B (en) | Deduplication processing method and storage device | |
| CN102999922A (en) | Multi-cell automatic tracking method and system based on plurality of task ant systems | |
| CN106649146A (en) | Memory release method and apparatus | |
| CN107622020A (en) | A kind of date storage method, access method and device | |
| WO2015180394A1 (en) | Method and device for recovering checkpoint in copy on write based file system | |
| CN107203330A (en) | A kind of flash data location mode towards read-write data flow | |
| CN108228339B (en) | Memory recovery method and device, terminal equipment and computer readable storage medium | |
| CN106339496A (en) | Method and device for clearing photos | |
| US20120296906A1 (en) | Grid-based data clustering method | |
| CN105530554A (en) | Video abstraction generation method and device | |
| CN111142794A (en) | Method, device and equipment for classified storage of data and storage medium | |
| CN105892939A (en) | Information processing method and electronic equipment | |
| CN106020717A (en) | Data processing method and electronic device | |
| CN106934015A (en) | Address date treating method and apparatus | |
| CN116185624A (en) | Garbage collection method and device for hard disk, computer equipment and storage medium | |
| US9286204B2 (en) | Memory controller |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170302 Address after: The 100176 branch of the Beijing economic and Technological Development Zone fourteen Street No. 99 building 33 building D No. 2226 Applicant after: Beijing legend core technology Co., Ltd. Address before: 100085 Beijing on the road to entrepreneurship, No. 6 Haidian District Applicant before: Lenovo (Beijing) Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160824 |
|
| RJ01 | Rejection of invention patent application after publication |