CN103049393B - Memory headroom management method and device - Google Patents
Memory headroom management method and device Download PDFInfo
- Publication number
- CN103049393B CN103049393B CN201210406017.8A CN201210406017A CN103049393B CN 103049393 B CN103049393 B CN 103049393B CN 201210406017 A CN201210406017 A CN 201210406017A CN 103049393 B CN103049393 B CN 103049393B
- Authority
- CN
- China
- Prior art keywords
- memory headroom
- data
- memory
- headroom
- sub
- 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.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 37
- 230000005012 migration Effects 0.000 claims abstract description 15
- 238000013508 migration Methods 0.000 claims abstract description 15
- 230000008569 process Effects 0.000 claims description 18
- 238000010586 diagram Methods 0.000 description 8
- 238000000151 deposition Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000008859 change Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
Landscapes
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention discloses a kind of memory headroom management method and device, described method comprises: if the stale data in the first memory headroom has reached a certain threshold value, then judge whether also have valid data in described first memory headroom, if any, from described first memory headroom, then take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom; As nothing, then discharge described first memory headroom; Hashing operation is carried out to the data of taking out from described first memory headroom, obtains the memory address of described data in the second memory headroom, described data are written in this memory address of described second memory headroom.The present invention can meet buffer memory capacity and expand/demand of reduction, and can ensure during Data Migration again, user can normally access cache data; When data traffic peak, the pressure of database or disk can also be alleviated simultaneously, and then increase the stability of integrity service.
Description
Technical field
The present invention relates to data communication technology field, be specifically related to a kind of memory headroom management method and device.
Background technology
Current many large-scale internet products and service, more and more use caching technology.The technician of website, the hot spot data of user's access, can be placed in internal memory and carries out buffer memory usually.When other users access identical data, directly can read from internal memory, and the data read are returned to user, to avoid searching from the slow devices such as database or disk.
Although the equipment of many cache classes is widely used, but most buffer memory device is when insufficient memory, all need the internal memory again applying for one piece of greater room to operating system, discharge old region of memory simultaneously, with migration or padding data in this new memory headroom.But such way, be easy to bring certain " jolting " upper level applications, namely on the time point of internal memory dilatation, make data cached whole inefficacy, and now all user's access, all must go data found by database or disk, thus add the response time of user's access, make the access pressure of disk moment excessive simultaneously.
The present invention is directed to the problems referred to above that existing buffer memory device occurs when buffer memory dilatation, propose a solution, namely by the strategy of timesharing Mobile data, the data smoothing in current memory space is migrated in another memory headroom.Can meet the demand that buffer memory capacity expands like this, can ensure again during internal memory dilatation, user can normally access cache data; When data traffic peak, the pressure of database or disk can be alleviated simultaneously, and then increase the stability of integrity service.
Summary of the invention
In view of the above problems, propose the present invention to provide a kind of overcoming the problems referred to above or the memory headroom management method solved the problem at least in part and device, the present invention is when carrying out dilatation to buffer memory at every turn, do not discharge current memory space immediately, but according to certain time interval (such as every 100 milliseconds), slowly the Data Migration in current memory space to another memory headroom, after total data has been moved, then discharge current memory space.
According to one aspect of the present invention, provide a kind of memory headroom management method, comprising:
If the stale data in the first memory headroom has reached a certain threshold value, then judge whether also have valid data in described first memory headroom, if any, from described first memory headroom, then take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom; As nothing, then discharge described first memory headroom;
Hashing operation is carried out to the data of taking out from described first memory headroom, obtains the memory address of described data in the second memory headroom, described data are written in this memory address of described second memory headroom.
Alternatively, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
Alternatively, after the stale data in described first memory headroom has reached a certain threshold value, reducing in memory headroom to identify described first memory headroom for described first memory headroom arranges a zone bit.
Alternatively, when the stale data in the first memory headroom has reached a certain threshold value, judge whether also have valid data in described first memory headroom every a time interval.
Alternatively, data are stored into after in described second memory headroom, these data in described first memory headroom are deleted.
Alternatively, in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then first send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
According to a further aspect in the invention, provide a kind of memory headroom management devices, comprising:
Judge sub-device, be suitable for when the stale data in the first memory headroom has reached a certain threshold value, judge whether also have valid data in described first memory headroom;
Read sub-device, when being suitable for also having valid data in described first memory headroom, from described first memory headroom, take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom;
Discharge sub-device, when being suitable for there is no valid data in described first memory headroom, discharge described first memory headroom;
Process sub-device, the data be suitable for taking out from described first memory headroom carry out hashing operation, obtain the memory address of described data in the second memory headroom;
Write sub-device, be suitable for the data of taking out from described first memory headroom to be written in this memory address of described second memory headroom.
Alternatively, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
Alternatively, also comprise the sub-device of mark, after the stale data be suitable in described first memory headroom has reached a certain threshold value, reducing in memory headroom to identify the first memory headroom described in this for described first memory headroom arranges a zone bit.
Alternatively, the sub-device of described judgement, when the stale data in the first memory headroom has reached a certain threshold value, judges whether also have valid data in described first memory headroom every a time interval.
Alternatively, also comprise and delete sub-device, be suitable for data being stored into after in described second memory headroom, these data in described first memory headroom are deleted.
Alternatively, also comprise and control sub-device, be suitable in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then control first to send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
According to technique scheme of the present invention, stability and the reliability of system can be improved greatly, when data traffic peak, the dilatation that buffer memory is level and smooth can be ensured, in the process of buffer memory dilatation, data access for user still can respond rapidly, improves cache data access hit rate greatly.Solve the problems referred to above that prior art exists thus, achieve for the comparatively responsive operation system of data cached change, the peak load decline 30%-50% of system, the response average velocity of user's request improves the beneficial effect of 2-3 second.
Technique scheme of the present invention can also need flexible configuration according to concrete application simultaneously, such as, can according to the difference of operation system, select the size of buffer memory dilatation, and the interval time of each migration, simultaneously when there is a large amount of stale data, also reversely can reduce spatial cache smoothly.
Above-mentioned explanation is only the general introduction of technical solution of the present invention, in order to technological means of the present invention can be better understood, and can be implemented according to the content of instructions, and can become apparent, below especially exemplified by the specific embodiment of the present invention to allow above and other objects of the present invention, feature and advantage.
Accompanying drawing explanation
By reading hereafter detailed description of the preferred embodiment, various other advantage and benefit will become cheer and bright for those of ordinary skill in the art.Accompanying drawing only for illustrating the object of preferred implementation, and does not think limitation of the present invention.And in whole accompanying drawing, represent identical parts by identical reference symbol.In the accompanying drawings:
Fig. 1 shows a kind of according to an embodiment of the invention to the data cached method flow diagram operated;
Fig. 2 show according to an embodiment of the invention by the Data Migration of the first memory headroom to the schematic diagram of the first memory headroom of dilatation;
Fig. 3 shows the schematic diagram traveling through each address in the first memory headroom according to an embodiment of the invention;
Fig. 4 shows a kind of in accordance with another embodiment of the present invention to the data cached method flow diagram operated; And
Fig. 5 shows the process flow diagram of memory headroom management method according to an embodiment of the invention.
Embodiment
Below with reference to accompanying drawings exemplary embodiment of the present disclosure is described in more detail.Although show exemplary embodiment of the present disclosure in accompanying drawing, however should be appreciated that can realize the disclosure in a variety of manners and not should limit by the embodiment set forth here.On the contrary, provide these embodiments to be in order to more thoroughly the disclosure can be understood, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
According to an aspect of the present invention, propose a kind of to the data cached method operated, as shown in Figure 1, the method comprises the following steps:
Step S1, if the data in the first memory headroom have been write full, has then judged whether described first memory headroom is empty, if not, then from described first memory headroom, takes out the data being positioned at reference position, until take out all data in described first memory headroom; If so, described first memory headroom is then discharged;
Step S2, carries out hashing operation to the data of taking out from described first memory headroom, obtains the memory address of described data in the second memory headroom, described data is written in this memory address of described second memory headroom.
Wherein, the capacity of described second memory headroom is greater than the capacity of described first memory headroom.
Alternatively, after described first memory headroom is fully written, for described first memory headroom arranges a zone bit to identify described first memory headroom just in dilatation.Fig. 2 shows the schematic diagram traveling through each address in the first memory headroom according to an embodiment of the invention, as shown in Figure 2, during each migration data, from the first memory headroom, take out the data being positioned at reference position, until take out all data in the first memory headroom.
Alternatively, when the data in the first memory headroom are write full, judge whether described first memory headroom is empty, and the described time interval such as can be 100 milliseconds every a time interval.Alternatively, described hashing operation can carry out when taking out data from described first memory headroom at every turn.
Alternatively, data are stored into after in the second memory headroom, these data in described first memory headroom are deleted, such as can data be stored into after in the second memory headroom at every turn, these data in described first memory headroom are deleted.
For the key of the some addresses in the first memory headroom, wherein, key is the unique identification of some user-defined a certain storage data, memory location corresponding with this key in the second memory headroom can be obtained according to hash algorithm, such as, if the key of the some addresses in the first memory headroom is bd919769e9, after hash algorithm, then obtain memory address corresponding with it in the second memory headroom is: hash (bd919769e9)=08, that is, when moving data cached, memory address in Data Migration to the second memory headroom being stored in bd919769e9 in first memory headroom is numbered the position of 08.
The realization of hashing operation, can be defined by developer oneself: such as, the grid that the memory location of foundation and word is corresponding in file system, in grid, preserve the word of storage, such as name, name is converted to stroke number, then such as name 10 strokes is altogether stored in grid corresponding to stroke numeral, be placed on No. 10 grid, just by hashing operation, planned existed in grid.
Travel through each address in the first memory headroom so successively, just can by the data cached timesharing in the first memory headroom, all move in the second memory headroom.
Such as, as shown in Figure 3, if current memory headroom can store 12 data, along with data constantly increase, article 12, storage space can not meet the demand of user, then the data in current memory headroom can automatically apply for one piece of memory headroom can depositing 24 data when writing full, and the data in current memory space be moved in the memory headroom can depositing 24 data slowly, after total data has been moved, then discharge current memory space.In Fig. 3, upper figure represents the current memory headroom can not met consumers' demand, and figure below represents that the capacity of new application is greater than another content space in current memory space.
In the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then first send read data request to the first memory headroom, when reading unsuccessfully, then send read data request to the second memory headroom.
According to another embodiment of the present invention to the data cached method flow diagram operated as shown in Figure 4, in the diagram, first judge whether the data in the first memory headroom have been write full, if not, then process ends; If, then every a time interval, judge whether described first memory headroom is empty, if not, from described first memory headroom, then take out the data being positioned at reference position carry out hashing operation, obtain the memory address of described data in the second memory headroom, described data are written in this memory address of described second memory headroom, until take out all data of described first memory headroom, simultaneously, data are being stored into after in the second memory headroom, these data in described first memory headroom are being deleted; If so, then discharge described first memory headroom, flow process terminates.
According to a further aspect in the invention, propose a kind of to the data cached device operated, this device comprises:
Judge sub-device, be suitable for when the data in the first memory headroom are write full, judge whether described first memory headroom is empty;
Read sub-device, be suitable at described first memory headroom not for time empty, from described first memory headroom, taking-up is positioned at the data of reference position, until take out all data in described first memory headroom;
Discharge sub-device, be suitable for, when described first memory headroom is for sky, discharging described first memory headroom;
Process sub-device, the data be suitable for taking out from described first memory headroom carry out hashing operation, obtain the memory address of described data in the second memory headroom;
Write sub-device, be suitable for the data of taking out from described first memory headroom to be written in this memory address of described second memory headroom.
Wherein, the capacity of described second memory headroom is greater than the capacity of described first memory headroom.
Alternatively, described device also comprises the sub-device of mark, is suitable for after described first memory headroom is fully written, for described first memory headroom arranges a zone bit to identify described first memory headroom just in dilatation.
Alternatively, every a time interval, the sub-device of described judgement, when the data in the first memory headroom are write full, judges whether described first memory headroom is empty, and the described time interval such as can be 100 milliseconds.
Alternatively, described device also comprises deletes sub-device, be suitable for data being stored into after in described second memory headroom, these data in described first memory headroom are deleted, such as data can be stored into after in the second memory headroom at every turn, these data in described first memory headroom are being deleted.
Alternatively, described device also comprises the sub-device of control, be suitable in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then control first to send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
In addition, when a large amount of stale datas appears in the first memory headroom, also can reduce this memory headroom smoothly according to the method for similar technique scheme is reverse, that is:
According to an aspect of the present invention, propose a kind of memory headroom management method, as shown in Figure 5, the method comprises the following steps:
Step S1, if the stale data in the first memory headroom has reached a certain threshold value, then judge whether also have valid data in described first memory headroom, if any, from described first memory headroom, then take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom; As nothing, then discharge described first memory headroom;
Step S2, carries out hashing operation to the data of taking out from described first memory headroom, obtains the memory address of described data in the second memory headroom, described data is written in this memory address of described second memory headroom.
Wherein, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
Alternatively, after the stale data in described first memory headroom has reached a certain threshold value, reducing in memory headroom to identify described first memory headroom for described first memory headroom arranges a zone bit.
Alternatively, when the stale data in the first memory headroom has reached a certain threshold value, judge whether also have valid data in described first memory headroom every a time interval, the described time interval such as can be 100 milliseconds.
Alternatively, described hashing operation can carry out when taking out data from described first memory headroom at every turn.
Alternatively, data are stored into after in described second memory headroom, these data in described first memory headroom are deleted, such as can data be stored into after in the second memory headroom at every turn, these data in described first memory headroom are deleted.
Travel through each address in the first memory headroom so successively, just can by the data cached timesharing in the first memory headroom, all move in the second memory headroom.
Such as, if store 24 data in current memory headroom, wherein 12 is stale data, in order to the storage resources of the system of saving, automatically one piece of space can depositing 12 data can be applied for, and the valid data in current memory space are moved to slowly in the memory headroom can depositing 12 data, after total data has been moved, then discharge current memory space.
In the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then first send read data request to the first memory headroom, when reading unsuccessfully, then read request of data to the second memory headroom space.
According to a further aspect in the invention, propose a kind of memory headroom management devices, this device comprises:
Judge sub-device, be suitable for when the stale data in the first memory headroom has reached a certain threshold value, judge whether also have valid data in described first memory headroom;
Read sub-device, when being suitable for also having valid data in described first memory headroom, from described first memory headroom, take out the valid data being positioned at reference position, until take out all data in described first memory headroom;
Discharge sub-device, when being suitable for there is no valid data in described first memory headroom, discharge described first memory headroom;
Process sub-device, the data be suitable for taking out from described first memory headroom carry out hashing operation, obtain the memory address of described data in the second memory headroom;
Write sub-device, be suitable for the data of taking out from described first memory headroom to be written in this memory address of described second memory headroom.
Wherein, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
Alternatively, described device also comprises the sub-device of mark, after the stale data be suitable in described first memory headroom has reached a certain threshold value, is reducing in memory headroom to identify the first memory headroom described in this for described first memory headroom arranges a zone bit.
Alternatively, the sub-device of described judgement is when the stale data in the first memory headroom has reached a certain threshold value, and judge whether also have valid data in described first memory headroom every a time interval, the described time interval such as can be 100 milliseconds.
Alternatively, described device also comprises deletes sub-device, be suitable for data being stored into after in described second memory headroom, these data in described first memory headroom are deleted, such as data can be stored into after in the second memory headroom at every turn, these data in described first memory headroom are being deleted.
Alternatively, described device also comprises the sub-device of control, be suitable in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then control first to send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
Intrinsic not relevant to any certain computer, virtual system or miscellaneous equipment with display at this algorithm provided.Various general-purpose system also can with use based on together with this teaching.According to description above, the structure constructed required by this type systematic is apparent.In addition, the present invention is not also for any certain programmed language.It should be understood that and various programming language can be utilized to realize content of the present invention described here, and the description done language-specific is above to disclose preferred forms of the present invention.
In instructions provided herein, describe a large amount of detail.But can understand, embodiments of the invention can be put into practice when not having these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.
Similarly, be to be understood that, in order to simplify the disclosure and to help to understand in each inventive aspect one or more, in the description above to exemplary embodiment of the present invention, each feature of the present invention is grouped together in single embodiment, figure or the description to it sometimes.But, the method for the disclosure should be construed to the following intention of reflection: namely the present invention for required protection requires feature more more than the feature clearly recorded in each claim.Or rather, as claims below reflect, all features of disclosed single embodiment before inventive aspect is to be less than.Therefore, the claims following embodiment are incorporated to this embodiment thus clearly, and wherein each claim itself is as independent embodiment of the present invention.
Those skilled in the art are appreciated that and adaptively can change the module in the equipment in embodiment and they are arranged in one or more equipment different from this embodiment.Module in embodiment or unit or assembly can be combined into a module or unit or assembly, and multiple submodule or subelement or sub-component can be put them in addition.Except at least some in such feature and/or process or unit be mutually repel except, any combination can be adopted to combine all processes of all features disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) and so disclosed any method or equipment or unit.Unless expressly stated otherwise, each feature disclosed in this instructions (comprising adjoint claim, summary and accompanying drawing) can by providing identical, alternative features that is equivalent or similar object replaces.
In addition, those skilled in the art can understand, although embodiments more described herein to comprise in other embodiment some included feature instead of further feature, the combination of the feature of different embodiment means and to be within scope of the present invention and to form different embodiments.Such as, in the following claims, the one of any of embodiment required for protection can use with arbitrary array mode.
All parts embodiment of the present invention with hardware implementing, or can realize with the software module run on one or more processor, or realizes with their combination.It will be understood by those of skill in the art that the some or all functions to the some or all parts in the device of data cached operation that microprocessor or digital signal processor (DSP) can be used in practice to realize according to the embodiment of the present invention.The present invention can also be embodied as part or all equipment for performing method as described herein or device program (such as, computer program and computer program).Realizing program of the present invention and can store on a computer-readable medium like this, or the form of one or more signal can be had.Such signal can be downloaded from internet website and obtain, or provides on carrier signal, or provides with any other form.
The present invention will be described instead of limit the invention to it should be noted above-described embodiment, and those skilled in the art can design alternative embodiment when not departing from the scope of claims.In the claims, any reference symbol between bracket should be configured to limitations on claims.Word " comprises " not to be got rid of existence and does not arrange element in the claims or step.Word "a" or "an" before being positioned at element is not got rid of and be there is multiple such element.The present invention can by means of including the hardware of some different elements and realizing by means of the computing machine of suitably programming.In the unit claim listing some devices, several in these devices can be carry out imbody by same hardware branch.Word first, second and third-class use do not represent any order.Can be title by these word explanations.
Claims (10)
1. a memory headroom management method, comprising:
If the stale data in the first memory headroom has reached a certain threshold value, then judge whether also have valid data in described first memory headroom every a time interval, if any, from described first memory headroom, then take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom; As nothing, then discharge described first memory headroom;
Hashing operation is carried out to the data of taking out from described first memory headroom, obtains the memory address of described data in the second memory headroom, described data are written in this memory address of described second memory headroom.
2. the method for claim 1, is characterized in that, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
3. method as claimed in claim 2, is characterized in that, after the stale data in described first memory headroom has reached a certain threshold value, reducing in memory headroom for described first memory headroom arranges a zone bit to identify described first memory headroom.
4. the method for claim 1, is characterized in that, data is stored into after in described second memory headroom, these data in described first memory headroom is deleted.
5. the method for claim 1, it is characterized in that, in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then first send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
6. a memory headroom management devices, comprising:
Judge sub-device, be suitable for when the stale data in the first memory headroom has reached a certain threshold value, judge whether also have valid data in described first memory headroom every a time interval;
Read sub-device, when being suitable for also having valid data in described first memory headroom, from described first memory headroom, take out the valid data being positioned at reference position, until take out valid data all in described first memory headroom;
Discharge sub-device, when being suitable for there is no valid data in described first memory headroom, discharge described first memory headroom;
Process sub-device, the data be suitable for taking out from described first memory headroom carry out hashing operation, obtain the memory address of described data in the second memory headroom;
Write sub-device, be suitable for the data of taking out from described first memory headroom to be written in this memory address of described second memory headroom.
7. device as claimed in claim 6, it is characterized in that, the capacity of described second memory headroom is less than the capacity of described first memory headroom.
8. device as claimed in claim 7, it is characterized in that, also comprise the sub-device of mark, after the stale data be suitable in described first memory headroom has reached a certain threshold value, reducing in memory headroom to identify the first memory headroom described in this for described first memory headroom arranges a zone bit.
9. device as claimed in claim 6, is characterized in that, also comprises and deletes sub-device, be suitable for data being stored into after in described second memory headroom, these data in described first memory headroom is deleted.
10. device as claimed in claim 6, it is characterized in that, also comprise and control sub-device, be suitable in the process of the Data Migration of memory headroom buffer memory, if user conducts interviews to the data be buffered in memory headroom, then control first to send read data request to described first memory headroom, when reading unsuccessfully, then send read data request to described second memory headroom.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210406017.8A CN103049393B (en) | 2012-10-23 | 2012-10-23 | Memory headroom management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210406017.8A CN103049393B (en) | 2012-10-23 | 2012-10-23 | Memory headroom management method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103049393A CN103049393A (en) | 2013-04-17 |
| CN103049393B true CN103049393B (en) | 2015-11-25 |
Family
ID=48062040
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210406017.8A Active CN103049393B (en) | 2012-10-23 | 2012-10-23 | Memory headroom management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103049393B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105550328A (en) * | 2015-12-18 | 2016-05-04 | 浪潮(北京)电子信息产业有限公司 | Processing method and device of stale data |
| CN105740098A (en) * | 2016-01-26 | 2016-07-06 | 浪潮(北京)电子信息产业有限公司 | Determination method and system for stale data among backup data |
| CN105929851B (en) * | 2016-04-07 | 2019-08-09 | 广州盈可视电子科技有限公司 | It is a kind of that holder method and apparatus are controlled using rocking bar equipment |
| CN106503260B (en) * | 2016-11-18 | 2020-04-28 | 北京奇虎科技有限公司 | Method and device for improving effective storage space of database |
| CN107085900B (en) * | 2017-03-22 | 2019-05-07 | 百富计算机技术（深圳）有限公司 | Data processing method, device, system and POS terminal |
| CN107273208B (en) * | 2017-06-05 | 2020-06-23 | ***股份有限公司 | Online releasing method, device and system for AIX host memory |
| CN108319654B (en) * | 2017-12-29 | 2021-12-21 | ***股份有限公司 | Computing system, cold and hot data separation method and device, and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102346769A (en) * | 2011-09-20 | 2012-02-08 | 奇智软件（北京）有限公司 | Method and device for consolidating registry file |
| CN102567415A (en) * | 2010-12-31 | 2012-07-11 | 百度在线网络技术（北京）有限公司 | Control method and device of database |
-
2012
- 2012-10-23 CN CN201210406017.8A patent/CN103049393B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567415A (en) * | 2010-12-31 | 2012-07-11 | 百度在线网络技术（北京）有限公司 | Control method and device of database |
| CN102346769A (en) * | 2011-09-20 | 2012-02-08 | 奇智软件（北京）有限公司 | Method and device for consolidating registry file |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103049393A (en) | 2013-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103049393B (en) | Memory headroom management method and device | |
| CN103425600B (en) | Address mapping method in a kind of solid-state disk flash translation layer (FTL) | |
| CN102981963B (en) | A kind of implementation method of flash translation layer (FTL) of solid-state disk | |
| CN103019956B (en) | A kind of to data cached method of operating and device | |
| CN102789427A (en) | Data storage device and operation method thereof | |
| CN109582593B (en) | FTL address mapping reading and writing method based on calculation | |
| CN103631536B (en) | A kind of method utilizing the invalid data of SSD to optimize RAID5/6 write performance | |
| EP2665065A2 (en) | Electronic device employing flash memory | |
| CN104809237A (en) | LSM-tree (The Log-Structured Merge-Tree) index optimization method and LSM-tree index optimization system | |
| CN103019958A (en) | Method for managing data in solid state memory through data attribute | |
| CN104462240A (en) | Method and system for realizing hierarchical storage and management in cloud storage | |
| CN107256196A (en) | The caching system and method for support zero-copy based on flash array | |
| CN108073522A (en) | Garbage collection method for data storage device | |
| CN105718206A (en) | Flash translation layer capable of perceiving RAID (Redundant Array of Independent Disks) and implementation method thereof | |
| CN104598394A (en) | Data caching method and system capable of conducting dynamic distribution | |
| CN103309815A (en) | Method and system for increasing available capacity and service life of solid state disc | |
| CN112148217B (en) | Method, device and medium for caching deduplication metadata of full flash memory system | |
| CN106055274A (en) | Data storage method, data reading method and electronic device | |
| CN110795363A (en) | Hot page prediction method and page scheduling method for storage medium | |
| CN104035925A (en) | Data storage method and device and storage system | |
| CN102521161B (en) | Data caching method, device and server | |
| CN102650972B (en) | Date storage method, Apparatus and system | |
| CN102073594A (en) | Method for attenuating thermal data | |
| CN104391947B (en) | Magnanimity GIS data real-time processing method and system | |
| CN202443462U (en) | Device for assisting upper computer to search free block in page mapping unit block |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220725 Address after: Room 801, 8th floor, No. 104, floors 1-19, building 2, yard 6, Jiuxianqiao Road, Chaoyang District, Beijing 100015 Patentee after: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Address before: 100088 room 112, block D, 28 new street, new street, Xicheng District, Beijing (Desheng Park) Patentee before: BEIJING QIHOO TECHNOLOGY Co.,Ltd. Patentee before: Qizhi software (Beijing) Co.,Ltd. |
|
| TR01 | Transfer of patent right |