CN109271111A - A kind of method for refreshing data, device and computer readable storage medium - Google Patents
A kind of method for refreshing data, device and computer readable storage medium Download PDFInfo
- Publication number
- CN109271111A CN109271111A CN201811124188.5A CN201811124188A CN109271111A CN 109271111 A CN109271111 A CN 109271111A CN 201811124188 A CN201811124188 A CN 201811124188A CN 109271111 A CN109271111 A CN 109271111A
- Authority
- CN
- China
- Prior art keywords
- superblock
- target
- refresh
- lower brush
- value
- 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/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- 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/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0656—Data buffering arrangements
-
- 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/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
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 Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a kind of method for refreshing data, device and computer readable storage mediums, when having detected superblock generation, then establish refresh process corresponding with the superblock；Judge whether target superblock meets refresh requirements；Wherein, target superblock is any one superblock in all superblocks.It when target superblock meets refresh requirements, then can use target refresh process corresponding with the target superblock, lower brush operation executed to target superblock.Only lower brush operation is carried out to all superblocks according to the flush mechanism carried in operating system in the prior art to compare, in the technical scheme, refresh process corresponding thereto can be established for each superblock, targetedly lower brush operation can be executed in conjunction with the actual conditions of each superblock, the frequency of brush data under improving current device to the back-end, it reduces under high-bandwidth scenarios, brush operation bring bandwidth fluctuation, improves the performance that operation is brushed under data under rear end.
Description
Technical field
The present invention relates to technical field of distributed memory, more particularly to a kind of method for refreshing data, device and computer
Readable storage medium storing program for executing.
Background technique
Distributed storage generally uses the core client of oneself independent design, general core client in high-performance field
Performance be it is relatively high, core client is in design for flush mechanism that stability generally uses linux kernel included.Brush
New mechanism is referred to executing rule operation to the data that client is written, i.e., is stored these data into corresponding disk.
Often operation has a various applications on one machine, the included flush mechanism of operating system can according to cycle time or
The conditions such as person's data volume carry out lower brush to each application on machine and operate.By taking data volume as an example, the included refreshing machine of operating system
System is detected to the total amount of data in all applications, when total amount of data reaches preset value, then to corresponding to each application
Data carry out lower brush operation.
In actual operation, different to be not quite similar using corresponding data volume, it is possible that some or certain answer
Data volume alreadys exceed its corresponding data upper limit value, but the corresponding total amount of data of all applications is still not up to preset value
The case where, operating system is not up to the condition for executing lower brush operation at this time, will not the data of each application be executed with lower brush operation, from
And cause the application for having reached data upper limit value that can not receive the data being newly written.And data volume corresponding to different application
Difference when operating system executes lower brush operation, often generates biggish bandwidth fluctuation, or even there is a situation where data packetloss,
And influence the write-in of front end applications data.
It is those skilled in the art's urgent problem to be solved as it can be seen that how to promote the performance for brushing operation under data.
Summary of the invention
The purpose of the embodiment of the present invention is that a kind of method for refreshing data, device and computer readable storage medium are provided, it can
To promote the performance for brushing operation under data.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of method of Refresh Data, comprising:
When having detected superblock generation, then refresh process corresponding with the superblock is established；
Judge whether target superblock meets refresh requirements；
If so, executing lower brush operation to the target superblock using target refresh process；Wherein, the target is super
Block is any one superblock in all superblocks；The target refresh process is corresponding with the target superblock
Refresh process.
Optionally, described to judge whether target superblock meets refresh requirements and include:
Judge whether the data volume of the target superblock is greater than or equal to preset upper limit value；Or judge that the target is super
Whether the space occupancy rate of block is greater than or equal to preset threshold；Or judge whether the lower brush time interval of the target superblock is big
In or equal to preset time value.
Optionally, in the case where the utilization target refresh process executes the target superblock before brush operation further include:
Judge whether the target superblock is carrying out the included lower brush operation of system；
If it is not, then executing described the step of executing lower brush operation to the target superblock using target refresh process；
If so, after the completion of waiting the lower brush to operate, then executes and described judge whether target superblock meets refreshing and want
The step of asking.
Optionally, further includes:
Record the undulating value that lower brush operation Time Bandwidth is executed to each superblock；
According to the undulating value, the parameter value for including in the refresh requirements is adjusted；The wherein parameter value packet
Include preset upper limit value, preset threshold or preset time value.
The embodiment of the invention also provides a kind of devices of Refresh Data, including establish unit, judging unit and execute list
Member；
It is described to establish unit, when for having detected superblock generation, then establish refreshing corresponding with the superblock
Process；
The judging unit, for judging whether target superblock meets refresh requirements；If so, triggering is described to execute list
Member；
The execution unit, for executing lower brush operation to the target superblock using target refresh process；Wherein, institute
Stating target superblock is any one superblock in all superblocks；The target refresh process is super with the target
The corresponding refresh process of grade block.
Optionally, the judging unit is pre- specifically for judging whether the data volume of the target superblock is greater than or equal to
If upper limit value；Or judge whether the space occupancy rate of the target superblock is greater than or equal to preset threshold；Or judge the mesh
Whether the lower brush time interval of mark superblock is greater than or equal to preset time value.
It optionally, further include the first judging unit；
First judging unit, for it is described using target refresh process to the target superblock execute under brush grasp
Before work, judge whether the target superblock is carrying out the included lower brush operation of system；Described list is executed if it is not, then triggering
Member；If so, after the completion of waiting the lower brush operation, moreover trigger the judging unit.
It optionally, further include recording unit and adjustment unit；
The recording unit, for recording the undulating value for executing lower brush operation Time Bandwidth to each superblock；
The adjustment unit, for being adjusted to the parameter value for including in the refresh requirements according to the undulating value；
Wherein the parameter value includes preset upper limit value, preset threshold or preset time value.
The embodiment of the invention also provides a kind of devices of Refresh Data, comprising:
Memory, for storing computer program；
Processor, the step of for executing the computer program to realize the method such as above-mentioned Refresh Data.
The embodiment of the invention also provides a kind of computer readable storage medium, deposited on the computer readable storage medium
The step of containing computer program, the method such as above-mentioned Refresh Data realized when the computer program is executed by processor.
When having detected superblock generation it can be seen from above-mentioned technical proposal, then establish corresponding with the superblock
Refresh process；Judge whether target superblock meets refresh requirements；Wherein, target superblock is any one in all superblocks
A superblock.When target superblock meets refresh requirements, then can use target refresh corresponding with the target superblock into
Journey executes lower brush operation to the target superblock.In the prior art only according to the flush mechanism pair carried in operating system
All superblocks carry out lower brush operation and compare, and in the technical scheme, each superblock can be established corresponding thereto
Refresh process can execute targetedly lower brush operation in conjunction with the actual conditions of each superblock, improve current device to
The frequency of brush data under rear end is reduced under high-bandwidth scenarios, and brush operation bring bandwidth fluctuation, improves under data under rear end
Brush the performance of operation.
Detailed description of the invention
In order to illustrate the embodiments of the present invention more clearly, attached drawing needed in the embodiment will be done simply below
It introduces, it should be apparent that, drawings in the following description are only some embodiments of the invention, for ordinary skill people
For member, without creative efforts, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is a kind of flow chart of the method for Refresh Data provided in an embodiment of the present invention；
Fig. 2 is a kind of structural schematic diagram of the device of Refresh Data provided in an embodiment of the present invention；
Fig. 3 is a kind of hardware structural diagram of the device of Refresh Data provided in an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, rather than whole embodiments.Based on this
Embodiment in invention, those of ordinary skill in the art are without making creative work, obtained every other
Embodiment belongs to the scope of the present invention.
In order to enable those skilled in the art to better understand the solution of the present invention, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.
Next, a kind of method of Refresh Data provided by the embodiment of the present invention is discussed in detail.Fig. 1 is that the present invention is implemented
A kind of flow chart of the method for Refresh Data that example provides, this method comprises:
S101: when having detected superblock generation, then refresh process corresponding with superblock is established.
In practical applications, when a node carry is when on a cluster, a superblock can be generated
(superblock)；When the node carry is when on two clusters, meeting generates two superblocks (superblock) accordingly.Often
A superblock can be used for caching the corresponding data that the node is written.
In order to effectively guarantee the normal work of each superblock, need timely to execute the data in superblock lower brush behaviour
Make.In view of difference can be directed to each super in embodiments of the present invention for the data volume that caches in different superblocks
Block sets a refresh process, which is used to execute corresponding superblock lower brush operation.
In the concrete realization, when one new superblock of every generation on node, then illustrate the application for having new on the node
It generates, then can establish refresh process corresponding with superblock at this time.In that way, it each of is directed on node super
Grade block could set up its corresponding refresh process.
S102: judge whether target superblock meets refresh requirements.
Superblock number on one node often has multiple, and the processing mode of each superblock is similar, in subsequent content
In be unfolded to introduce by taking any one superblock, that is, target superblock in all superblocks as an example, correspondingly, super with the target
The corresponding refresh process of grade block can be referred to as target refresh process.
Refresh requirements can be the critical condition that lower brush operation is executed to superblock.When whether target superblock meets refreshing
It is required that when, then illustrate to need to execute the target superblock lower brush operation, i.e. execution S103 at this time.
It in embodiments of the present invention, can be by the either lower brush time interval of data volume, space occupancy rate in superblock
Etc. parameters as the judgment basis in refresh requirements.
By taking data volume as an example, in the concrete realization, it can be determined that it is pre- whether the data volume of target superblock is greater than or equal to
If upper limit value.
Preset upper limit value can be the maximum value that data in superblock change storage, and specific value can be according to actual demand
It is set, it is not limited here.
When the data volume of target superblock is greater than or equal to preset upper limit value, illustrate that target superblock meets refreshing and wants
It asks, then can execute S103.
By taking space occupancy rate as an example, in the concrete realization, it can be determined that whether the space occupancy rate of target superblock is greater than
Or it is equal to preset threshold.
Space duty ratio can be the ratio of the data volume cached in superblock and the corresponding total storage size of superblock
Value.
Preset threshold can be the maximum value of the corresponding space occupancy rate of data in superblock, and specific value can foundation
Actual demand is set, it is not limited here.
The space occupancy rate of target superblock is greater than or equal to preset threshold, illustrates that target superblock meets refreshing and wants
It asks, then can execute S103.
For following brush time interval, in the concrete realization, it can be determined that whether the lower brush time interval of target superblock
More than or equal to preset time value.
Lower brush time interval can be current time and the last difference for executing the lower brush operating time.
Preset time value can be the time interval of the adjacent brush operation lower twice of data in superblock, and specific value can be with
It is set according to actual demand, it is not limited here.
When the lower brush time interval of target superblock is greater than or equal to preset time value, illustrate that target superblock is at this time
It is brushed under execution through reaching the time of operation, i.e., target superblock meets refresh requirements, then can execute S103.
S103: lower brush operation is executed to target superblock using target refresh process.
It include the concrete operations process that lower brush operation is executed to target superblock in target refresh process.
The number at most refreshed every time can be set in target refresh process, refresh the ginsengs such as the at most lower number of pages brushed every time
Number, the value of these parameters can be set according to actual demand.For example, at most refreshing 100 times every time, refresh every time most
Lower brush page 2048, every page of 4KB.
The specific implementation process and data are carried out down using the flush mechanism that system carries in the prior art that lower brush operates
The process for brushing operation is similar, and details are not described herein.
When having detected superblock generation it can be seen from above-mentioned technical proposal, then establish corresponding with the superblock
Refresh process；Judge whether target superblock meets refresh requirements；Wherein, target superblock is any one in all superblocks
A superblock.When target superblock meets refresh requirements, then can use target refresh corresponding with the target superblock into
Journey executes lower brush operation to the target superblock.In the prior art only according to the flush mechanism pair carried in operating system
All superblocks carry out lower brush operation and compare, and in the technical scheme, each superblock can be established corresponding thereto
Refresh process can execute targetedly lower brush operation in conjunction with the actual conditions of each superblock, improve current device to
The frequency of brush data under rear end is reduced under high-bandwidth scenarios, and brush operation bring bandwidth fluctuation, improves under data under rear end
Brush the performance of operation.
In embodiments of the present invention, under the flush mechanism that can be carried in reservation operations system carries out all superblocks
On the basis of brush operation, a refresh process is arranged for each superblock.It, may when both flush mechanisms exist simultaneously
It will appear while the case where lower brush operates is executed to superblock, in practical applications, when both flush mechanisms are almost same
When being triggered, it is only necessary to lower brush behaviour is executed to target superblock using any one flush mechanism in both flush mechanisms
Work.
Specifically, can first judge target before brush operation in the case where executing using target refresh process to target superblock
Whether superblock is carrying out the included lower brush operation of system.
When the flush mechanism that system carries currently does not execute lower brush operation to target superblock, i.e. target superblock is current
When being not carried out the lower brush operation that system carries, then it can execute brush under executing using target refresh process to target superblock and operate
The step of.
When the flush mechanism that system carries executes lower brush operation to target superblock, i.e. target superblock is being held
When the included lower brush of row system operates, then after the completion of lower brush can be waited to operate, then executes and judge whether target superblock meets
The step of refresh requirements.
Correspondingly, in practical applications, when the flush mechanism that system carries is triggered, can also first judge that target is super
Whether block is carrying out lower brush operation；When target superblock is carrying out the operation of lower brush, the included flush mechanism of system at this time
The target superblock can be then skipped, refresh process is carried out to other superblocks for being not carried out lower brush operation.
Since the flush mechanism that operating system carries is to carry out refresh process to all superblock, and target superblock institute
Corresponding target refresh process be only to target superblock carry out refresh process, therefore, in embodiments of the present invention, when this two
When kind flush mechanism is triggered simultaneously, then it can preferentially choose target refresh process and refresh process is carried out to target superblock.
Certainly in practical applications, the priority of both flush mechanisms can also be adjusted according to actual demand,
In the embodiment of the present invention, for both flush mechanisms priority without limitation.
When two kinds of flush mechanisms exist simultaneously, by the way that dual judgment mechanism is arranged, lower brush operation is effectively guaranteed
It orderly carries out, reduces the occupancy to system resource, further improve the treatment effeciency of Refresh Data.
Corresponding bandwidth can be occupied when executing lower brush operation to data, the fluctuation situation of bandwidth, which reflects, brushes operation under data
When system performance can carry out lifting system performance when bandwidth fluctuation is larger by adjusting the parameter value in refresh requirements.
Specifically, can recorde the undulating value for executing lower brush operation Time Bandwidth to each superblock, and according to undulating value, to brush
The parameter value for including in new demand is adjusted.
Undulating value can be node and execute the lower difference brushed between the maximum value and minimum value that operate Time Bandwidth.
Undulating value is smaller, illustrates that bandwidth when node executes lower brush operation is more stable, system performance is better；Undulating value is got over
Greatly, illustrate that the lower bandwidth brushed when operating of node execution is more unstable, system performance is poorer.
By in above-mentioned introduction it is found that the judgment basis of refresh requirements can there are many, be directed to it is different types of judgement according to
According to the parameter value for including in refresh requirements is different.When using data volume as judgment basis, the ginseng that includes in refresh requirements
Number can be preset upper limit value；When using space occupancy rate as judgment basis, the parameter for including in refresh requirements can be pre-
If threshold value；When following brush time interval is as judgment basis, the parameter for including in refresh requirements can be preset time value.
In the concrete realization, can be when undulating value be larger, the parameter value appropriate turned down in refresh requirements.Wave can be worked as
When dynamic value is smaller, then it appropriate can tune up parameter value in refresh requirements or keep parameter value constant.
In embodiments of the present invention, parameter involved in refresh requirements is dynamically adjusted by the undulating value according to bandwidth
Value, can make refresh requirements be more in line with actual conditions, so that the lower brush operation of data is accurate much sooner.
Fig. 2 be a kind of structural schematic diagram of the device of Refresh Data provided in an embodiment of the present invention, including establish unit 21,
Judging unit 22 and execution unit 23；
Unit 21 being established, when for having detected superblock generation, then establishing refresh process corresponding with superblock；
Judging unit 22, for judging whether target superblock meets refresh requirements；If so, triggering execution unit；
Execution unit 23, for executing lower brush operation to target superblock using target refresh process；Wherein, target is super
Block is any one superblock in all superblocks；Target refresh process is refresh process corresponding with target superblock.
Optionally, judging unit is specifically used for judging whether the data volume of target superblock is greater than or equal to preset upper limit
Value；Or judge whether the space occupancy rate of target superblock is greater than or equal to preset threshold；Or judge the lower brush of target superblock
Whether time interval is greater than or equal to preset time value.
It optionally, further include the first judging unit；
First judging unit, before the brush operation in the case where being executed using target refresh process to target superblock, judgement
Whether target superblock is carrying out the included lower brush operation of system；If it is not, then triggering execution unit；If so, waiting lower brush
After the completion of operation, moreover trigger judging unit.
It optionally, further include recording unit and adjustment unit；
Recording unit, for recording the undulating value for executing lower brush operation Time Bandwidth to each superblock；
Adjustment unit, for being adjusted to the parameter value for including in refresh requirements according to undulating value；Wherein parameter value packet
Include preset upper limit value, preset threshold or preset time value.
The explanation of feature may refer to the related description of embodiment corresponding to Fig. 1 in embodiment corresponding to Fig. 2, here no longer
It repeats one by one.
When having detected superblock generation it can be seen from above-mentioned technical proposal, then establish corresponding with the superblock
Refresh process；Judge whether target superblock meets refresh requirements；Wherein, target superblock is any one in all superblocks
A superblock.When target superblock meets refresh requirements, then can use target refresh corresponding with the target superblock into
Journey executes lower brush operation to the target superblock.In the prior art only according to the flush mechanism pair carried in operating system
All superblocks carry out lower brush operation and compare, and in the technical scheme, each superblock can be established corresponding thereto
Refresh process can execute targetedly lower brush operation in conjunction with the actual conditions of each superblock, improve current device to
The frequency of brush data under rear end is reduced under high-bandwidth scenarios, and brush operation bring bandwidth fluctuation, improves under data under rear end
Brush the performance of operation.
Fig. 3 is a kind of hardware structural diagram of the device 30 of Refresh Data provided in an embodiment of the present invention, comprising:
Memory 31, for storing computer program；
Processor 32, the step of for executing computer program to realize the method such as above-mentioned Refresh Data.
The embodiment of the invention also provides a kind of computer readable storage medium, it is stored on computer readable storage medium
Computer program, when computer program is executed by processor the step of the realization such as method of above-mentioned Refresh Data.
Be provided for the embodiments of the invention above a kind of method for refreshing data, device and computer readable storage medium into
It has gone and has been discussed in detail.Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with
The difference of other embodiments, the same or similar parts in each embodiment may refer to each other.For disclosed in embodiment
For device, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is referring to method portion
It defends oneself bright.It should be pointed out that for those skilled in the art, in the premise for not departing from the principle of the invention
Under, it can be with several improvements and modifications are made to the present invention, these improvement and modification also fall into the protection of the claims in the present invention
In range.
Professional further appreciates that, unit described in conjunction with the examples disclosed in the embodiments of the present disclosure
And algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Profession
Technical staff can use different methods to achieve the described function each specific application, but this realization is not answered
Think beyond the scope of this invention.
The step of method described in conjunction with the examples disclosed in this document or algorithm, can directly be held with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Claims (10)
1. a kind of method of Refresh Data characterized by comprising
When having detected superblock generation, then refresh process corresponding with the superblock is established；
Judge whether target superblock meets refresh requirements；
If so, executing lower brush operation to the target superblock using target refresh process；
Wherein, the target superblock is any one superblock in all superblocks；The target refresh process is
Refresh process corresponding with the target superblock.
2. judging whether target superblock meets refresh requirements packet the method according to claim 1, wherein described
It includes:
Judge whether the data volume of the target superblock is greater than or equal to preset upper limit value；Or judge the target superblock
Whether space occupancy rate is greater than or equal to preset threshold；Or judge the lower brush time interval of the target superblock whether be greater than or
Equal to preset time value.
3. method according to claim 1 or 2, which is characterized in that utilize target refresh process to the target described
Superblock executes before lower brush operation further include:
Judge whether the target superblock is carrying out the included lower brush operation of system；
If it is not, then executing described the step of executing lower brush operation to the target superblock using target refresh process；
If so, after the completion of waiting the lower brush to operate, then executes and described judge whether target superblock meets refresh requirements
Step.
4. the method according to claim 1, wherein further include:
Record the undulating value that lower brush operation Time Bandwidth is executed to each superblock；
According to the undulating value, the parameter value for including in the refresh requirements is adjusted；Wherein the parameter value includes pre-
If upper limit value, preset threshold or preset time value.
5. a kind of device of Refresh Data, which is characterized in that including establishing unit, judging unit and execution unit；
It is described to establish unit, when for having detected superblock generation, then establish refresh process corresponding with the superblock；
The judging unit, for judging whether target superblock meets refresh requirements；If so, triggering the execution unit；
The execution unit, for executing lower brush operation to the target superblock using target refresh process；Wherein, the mesh
Marking superblock is any one superblock in all superblocks；The target refresh process be and the target superblock
Corresponding refresh process.
6. device according to claim 5, which is characterized in that the judging unit is specifically used for judging that the target is super
Whether the data volume of block is greater than or equal to preset upper limit value；Or judge the space occupancy rate of the target superblock whether be greater than or
Equal to preset threshold；Or judge whether the lower brush time interval of the target superblock is greater than or equal to preset time value.
7. device according to claim 5 or 6, which is characterized in that further include the first judging unit；
First judging unit, for brushing operation in the case where the utilization target refresh process executes the target superblock
Before, judge whether the target superblock is carrying out the included lower brush operation of system；If it is not, then triggering the execution unit；
If so, after the completion of waiting the lower brush operation, moreover trigger the judging unit.
8. device according to claim 5, which is characterized in that further include recording unit and adjustment unit；
The recording unit, for recording the undulating value for executing lower brush operation Time Bandwidth to each superblock；
The adjustment unit, for being adjusted to the parameter value for including in the refresh requirements according to the undulating value；Wherein
The parameter value includes preset upper limit value, preset threshold or preset time value.
9. a kind of device of Refresh Data characterized by comprising
Memory, for storing computer program；
Processor, for executing the computer program to realize the side of the Refresh Data as described in Claims 1-4 any one
The step of method.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program, realizing the method for Refresh Data as described in any one of Claims 1-4 when the computer program is executed by processor
Step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811124188.5A CN109271111A (en) | 2018-09-26 | 2018-09-26 | A kind of method for refreshing data, device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811124188.5A CN109271111A (en) | 2018-09-26 | 2018-09-26 | A kind of method for refreshing data, device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109271111A true CN109271111A (en) | 2019-01-25 |
Family
ID=65198174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811124188.5A Pending CN109271111A (en) | 2018-09-26 | 2018-09-26 | A kind of method for refreshing data, device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109271111A (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508619A (en) * | 2011-11-21 | 2012-06-20 | 成都市华为赛门铁克科技有限公司 | Memory system, and method and system for controlling service quality of memory system |
-
2018
- 2018-09-26 CN CN201811124188.5A patent/CN109271111A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508619A (en) * | 2011-11-21 | 2012-06-20 | 成都市华为赛门铁克科技有限公司 | Memory system, and method and system for controlling service quality of memory system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105431862B (en) | For the key rotation of Memory Controller | |
| CN109697133A (en) | ID generation method, apparatus and system | |
| CN103078933B (en) | A kind of method and apparatus determining data migration time | |
| US20170090802A1 (en) | Device and Method for Scheduling Commands in a Solid State Drive to Reduce Peak Power Consumption Levels | |
| CN109739441A (en) | Data cached method is brushed under a kind of storage system | |
| CN107277128A (en) | The method and device of request processing order-preserving in a kind of distributed storage agreement | |
| CN107678918A (en) | The OSD heartbeat mechanisms method to set up and device of a kind of distributed file system | |
| CN109471843A (en) | A kind of metadata cache method, system and relevant apparatus | |
| CN106649031A (en) | Monitoring data obtaining method and device, and computer | |
| CN106951488A (en) | A kind of log recording method and device | |
| CN108647176A (en) | A kind of car networking equipment data transmission method and car networking equipment | |
| CN109614344A (en) | A kind of spatial cache recovery method, device, equipment and storage system | |
| CN107273056A (en) | A kind of date storage method and device of Ceph file system | |
| CN107623732A (en) | A kind of date storage method based on cloud platform, device, equipment and storage medium | |
| Kirsch et al. | Using a queue to de-amortize cuckoo hashing in hardware | |
| CN108762989A (en) | Date storage method, device, equipment and the readable storage medium storing program for executing of solid state disk | |
| CN103559142B (en) | The method for refreshing of dynamic RAM | |
| CN109491976A (en) | A kind of storing data analytic method, device and relevant device | |
| CN109343943A (en) | A kind of I/O management method based on the more queues of more external equipments | |
| CN111143733A (en) | Local data caching method and device, electronic equipment and readable storage medium | |
| CN109324761A (en) | A kind of data cache method, device, equipment and storage medium | |
| CN108984779A (en) | Distributed file system snapshot rollback metadata processing method, device and equipment | |
| CN107729178A (en) | A kind of Metadata Service process takes over method and device | |
| CN109271111A (en) | A kind of method for refreshing data, device and computer readable storage medium | |
| CN111176570B (en) | Thick backup roll creating method, device, equipment and medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190125 |
|
| RJ01 | Rejection of invention patent application after publication |