CN102521162B - Method and device for cache data processing - Google Patents
Method and device for cache data processing Download PDFInfo
- Publication number
- CN102521162B CN102521162B CN201110390186.2A CN201110390186A CN102521162B CN 102521162 B CN102521162 B CN 102521162B CN 201110390186 A CN201110390186 A CN 201110390186A CN 102521162 B CN102521162 B CN 102521162B
- Authority
- CN
- China
- Prior art keywords
- page
- superseded
- weighted value
- buffer zone
- time
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/12—Replacement control
- G06F12/121—Replacement control using replacement algorithms
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
- Memory System (AREA)
Abstract
The invention provides a method and device for cache data processing, relates to the technical field of communications, and solves the problems that the performance of a buffer is reduced by not timely deleting pages which are not accessed for a long time. The method comprises the following steps of: determining an elimination weight cardinal of a page; adding the elimination weight cardinal of the page with a first preset numeric value; if the elimination weight vale has a preset upper limit value, when the elimination scanning is carried out each time, subtracting a second preset numeric value from the elimination weight value which does not meet preset requirements; if the elimination weight vale has no a preset upper limit value, when the elimination scanning is carried out each time, calculating in a method that the elimination weight value which does not meet preset requirements is inversely proportional to the storage time of the corresponding page in a buffer to obtain the elimination weight value of the page; and deleting the page corresponding to the elimination weight value which meets preset requirements from the buffer. Thus the method and the device can be applied to buffer page replacement.
Description
Technical field
The present invention relates to communication technical field, particularly relate to the method and apparatus for data cached process.
Background technology
Flash memory is the novel storage medium of one occurred in recent years.When will show certain page in flash memory when computing machine, this page in flash memory is put into buffer zone by computing machine, because the page needs continuous lastest imformation, therefore, when long-time this page of display, stored in the information of this page a large amount of in buffer zone, make buffer zone not have enough spaces to perform other operation, cause computing power to decline.
Certain page performs and writes, before read operation in NAND (a kind of flash memory type) type flash memory, first by the page to be operated stored in buffer zone, the page needing to eliminate from buffer zone is determined in buffer zone according to the page in buffer zone " quoting position ", so that buffer zone has enough spaces perform other operation.
Concrete, when the page is first stored in buffer zone, the page " quoting position " puts 1; When any page in buffer zone is accessed, this page " quoting position " adds 1.
When eliminating the page, buffer zone is scan queue from the page of the current sensing of pointer, which page of pointed, and which page buffer zone scans, all pages namely stored in scanning buffer, is not that " quoting position " of the page of 0 subtracts 1 current " quoting position "; The page being 0 current " quoting position " is eliminated from buffer zone, the next page of pointed.
During scan round queue, if all pages found " quoting position " is not all 0, pointer will enclose around whole round-robin queue one, and all pages encountered " quoting position " is subtracted 1.
State in the process for data cached process in realization, when the page is accessed, this page " quoting position " is added 1, when being accessed frequently in this page short time, " quoting position " numerical value of this page is accumulated to very large, when this page is not accessed, this page need be scanned repeatedly in buffer zone, " quoting position " of this page can be kept to 0, therefore just can be deleted after stopping certain hour when this page is long-time not accessed in the buffer, cause this not accessed page to occupy between buffer empty, make the hydraulic performance decline of buffer zone.
Summary of the invention
Embodiments of the invention provide a kind of method for data cached process, device, solve because the long-time not accessed page is not deleted in time, cause this not accessed page to occupy between buffer empty, make the problem of the hydraulic performance decline of buffer zone.
For achieving the above object, embodiments of the invention adopt following technical scheme:
For a method for data cached process, comprising:
When the page reads in buffer zone for the first time, determine the superseded weight radix of the described page;
After the described page is performed operation, by cumulative for the superseded weight radix of the described page the first default value at every turn;
If described superseded weighted value has default higher limit, then after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence;
If the higher limit of described superseded weighted value Non-precondition, then when carrying out eliminating scanning at every turn, do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, obtain the superseded weighted value of this page current;
The page meeting described pre-conditioned superseded weighted value corresponding is deleted from described buffer zone.
For a device for data cached process, comprising:
Determining unit, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the described page;
Summing elements, for after the described page is performed operation at every turn, by cumulative for the superseded weight radix of the described page the first default value;
First computing unit, if there is default higher limit for described superseded weighted value, then after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence;
Second computing unit, if for the higher limit of described superseded weighted value Non-precondition, then when carrying out eliminating scanning at every turn, do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, obtain the superseded weighted value of this page current;
Delete cells, for deleting the page meeting described pre-conditioned superseded weighted value corresponding from described buffer zone.
The method and apparatus for data cached process that the embodiment of the present invention provides, when the page reads in buffer zone for the first time, determines the superseded weight radix of the described page; After the described page is performed operation, by cumulative for the superseded weight radix of the described page the first default value at every turn; If described superseded weighted value has default higher limit, then after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence; If the higher limit of described superseded weighted value Non-precondition, then when carrying out eliminating scanning at every turn, do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, obtain the superseded weighted value of this page current; The page meeting described pre-conditioned superseded weighted value corresponding is deleted from described buffer zone.
After adopting such scheme, by arranging superseded weight higher limit respectively to the page of different attribute, make those the short time by the superseded weighted value of the page long-time not accessed after repeatedly accessing for infinitely great, the superseded page weight value of this page can be reduced to and meet pre-conditioned numerical value by buffer zone at short notice; Or the mode that the time stored in the buffer according to superseded weighted value and the page is inversely proportional to calculates superseded weighted value, the not accessed page is deleted by buffer zone in time from buffer zone.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
A kind of method flow diagram for data cached process that Fig. 1 provides for the embodiment of the present invention;
Fig. 2 for the embodiment of the present invention provide when superseded weight does not have higher limit, the method flow diagram of data cached process;
The dirty page of buffer block deletion that Fig. 3 provides for the embodiment of the present invention and the time needed for the non-dirty page and required expense;
Fig. 4 for the embodiment of the present invention provide when superseded weight has higher limit, the method flow diagram of data cached process;
The constitutional diagram of the buffer zone that Fig. 5 provides for the embodiment of the present invention and the page;
When the superseded weight radix when the non-dirty page that Fig. 6 provides for the embodiment of the present invention, superseded weight higher limit are set to 0, the method flow diagram of data cached process;
A kind of apparatus structure schematic diagram for data cached process that Fig. 7 provides for the embodiment of the present invention;
Fig. 8 for the embodiment of the present invention provide when superseded weight does not have higher limit, the apparatus structure schematic diagram of data cached process;
Fig. 9 for the embodiment of the present invention provide when superseded weight has higher limit, the apparatus structure schematic diagram of data cached process;
When the superseded weight radix when the non-dirty page that Figure 10 provides for the embodiment of the present invention, superseded weight higher limit are set to 0, the apparatus structure schematic diagram of data cached process.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
The embodiment of the present invention provides a kind of method for data cached process, as shown in Figure 1, comprises the following steps:
101, the superseded weight radix of the page is determined.
Buffer zone is eliminated weighted value by the page and is determined whether the page of correspondence to delete from buffer zone, the superseded weighted value of the page is larger, this page is got over needs and is stored in the buffer, and the superseded weighted value of the page is less, and this page more should be deleted by from buffer zone.
After the page is performed corresponding operating, the superseded weighted value of this page can change, and the process of change is for carry out corresponding computing based on superseded weight radix.Eliminate weight radix be the page initially stored in buffer zone time superseded weighted value.
102, after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value, the superseded weighted value of current page is obtained.
In order to just not deleted by from buffer zone at the accessed page of making to store in buffer zone, after the page is accessed, by cumulative for the superseded weight radix of the page the first default value, obtain the superseded weighted value of current page.
If 103 eliminate weighted value have default higher limit, then after superseded weighted value reaches higher limit, stop weight accumulation radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned weighted value, obtaining the superseded weighted value of the page of current correspondence.
The every accessed mistake of the page in buffer zone once, cumulative first default value of the page weight of this page, by arranging superseded weight higher limit, make the page eliminate weight be added to higher limit after no longer cumulative.
By arranging superseded weight higher limit, make this page after frequent access, the page eliminates weight can not be added to infinitely-great value.
In order to make the long-time not accessed page can not take the space of buffer zone, when carrying out eliminating scanning at every turn, subtract the second default value by not meeting pre-conditioned superseded weighted value.
If the higher limit of 104 superseded weighted value Non-preconditions, then when each superseded scanning, calculating with the mode that the time that the corresponding page stores in the buffer is inversely proportional to according to not meeting pre-conditioned superseded weighted value, obtaining the weighted value of this page current.
It is longer that the page is stored in the time in buffer zone, and the time accessed apart from last time is longer, and this page more may be eliminated by from buffer zone.
As an embodiment of the present embodiment, if certain page does not have accessed within certain period, the time that the page stores in the buffer is longer, and the superseded weighted value of this page is less; The time that the page stores in the buffer is shorter, and the superseded weighted value of this page is larger.
Concrete, if eliminate the higher limit of weighted value Non-precondition, then when each superseded scanning, calculating with the mode that the time that the corresponding page stores in the buffer is inversely proportional to according to not meeting pre-conditioned superseded weighted value, obtaining the weighted value of this page current.
105, the page meeting pre-conditioned superseded weighted value corresponding is deleted from buffer zone.
When buffer zone carries out eliminating scanning to the page stored, judge whether the superseded weighted value of the page meets pre-conditioned; When the superseded weighted value of the page meets pre-conditioned, this page is deleted from buffer zone.
The pre-conditioned page is met by deleting superseded weighted value, can the space in buffer release district, for other pages provide storage space, improve the performance of buffer zone.
After adopting such scheme, by arranging superseded weight higher limit respectively to the page of different attribute, make those the short time by the superseded weighted value of the page long-time not accessed after repeatedly accessing for infinitely great, the superseded page weight value of this page can be reduced to and meet pre-conditioned numerical value by buffer zone at short notice; Or, the mode that the time stored in the buffer according to superseded weighted value and the page is inversely proportional to calculates superseded weighted value, the page residence time in the buffer and the expense of deleting needed for the page are fully taken into account, the not accessed page is eliminated by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
As the improvement of embodiment, the present embodiment provides the another kind of method for data cached process, when the method describes the higher limit when the superseded weighted value Non-precondition of the page, and the computing method that the superseded weight of the page is concrete, as shown in Figure 2, comprise the following steps:
201, the superseded weight radix of the page is determined.
Buffer zone is eliminated weighted value by the page and is determined whether the page of correspondence to delete from buffer zone, the superseded weighted value of the page is larger, this page is got over needs and is stored in the buffer, and the superseded weighted value of the page is less, and this page more should be deleted by from buffer zone.
After the page is performed corresponding operating, the superseded weighted value of this page can change, and the process of change is for carry out corresponding computing based on superseded weight radix.Eliminate weight radix be the page initially stored in buffer zone time superseded weighted value.
The page in buffer zone comprise the dirty page, with the non-dirty page; The dirty page is the page being performed write operation, and the non-dirty page is the page being performed read operation.
The setting of the present embodiment to the superseded weight radix of the page is not construed as limiting, and can set according to actual needs.
As an embodiment of the present embodiment, if when the page reads in buffer zone for the first time, what the page was performed is read operation, then the superseded weight radix of the page is 1, if when the page reads in buffer zone for the first time, what the page was performed is write operation, then the superseded weight radix of the page is μ.Wherein,
for read-write sex differernce coefficient.
202, after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value, the superseded weighted value of current page is obtained.
The page stored in buffer zone is just at the accessed page, in order to be that this page is not deleted by from buffer zone, after the page is accessed, by cumulative for the superseded weight radix of the page the first default value, obtains the superseded weighted value of current page.
As an embodiment of the present embodiment, according to formula ω
1=R+ μ * W to corresponding accessed after the superseded weighted value of the page to add up corresponding first default value.Wherein, R is that the page is performed read operation number of times; W is that the page is performed write operation number of times; ω
1for the page last time is performed the superseded weighted value after operation.
Different from the expense of deleting needed for the non-dirty page owing to deleting the dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, such as: the required time deleting a dirty page is longer than the time of the non-dirty page of deletion one, therefore, buffer zone is paid the utmost attention in delete buffer long-time not accessed, and the page that when deleting, expense is less.Fig. 3 for delete be performed read operation, the write operation page respectively needed for time and the expense of buffer zone.
The read operation expense provided in the present embodiment, write operation expense are content well known to those skilled in the art, do not repeat them here.
When the page is often performed a read operation, formula ω
1r in=R+ μ * W is added 1; When the page is often performed a write operation, formula ω
1w in=R+ μ * W is added 1.
Namely, after the page is performed read operation at every turn, by the superseded weight radix of the page cumulative 1, after the page is performed write operation at every turn, add up the superseded weight radix of the page μ (μ >=1).
The present embodiment is not construed as limiting the first default value, can set according to actual needs, as being set to 1.
203, judge whether eliminate weighted value meets pre-conditioned.
When carrying out in buffer zone eliminating scanning, first judge whether the superseded weighted value of the page meets pre-conditioned.
The pre-conditioned of superseded weighted value to the page does not limit the present embodiment, can set according to actual needs.
As an embodiment of the present embodiment, judge whether the superseded weighted value of the page is greater than 0, if the superseded weighted value of the page is not more than 0, namely meet pre-conditioned, then perform step 205; If the superseded weighted value of the page is greater than 0, namely do not meet pre-conditioned, then perform step 204.
204, when carrying out eliminating scanning at every turn, calculating with the mode that the time that the corresponding page stores in the buffer is inversely proportional to according to not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of this page current.
It is longer that the page is stored in the time in buffer zone, and the time accessed apart from last time is longer, and this page more may be deleted by from buffer zone.
As an embodiment of the present embodiment, when carrying out eliminating scanning at every turn, if the page does not have accessed within certain period, the time that the page stores in the buffer is longer, then the superseded weighted value of this page is less; The time that the page stores in the buffer is shorter, then the superseded weighted value of this page is larger.
As an embodiment of the present embodiment, if do not meet, page last time corresponding to pre-conditioned superseded weighted value be performed for write operation, then according to formula ω
2=ω
1* TLC-μ calculates the superseded weighted value of this page current; If do not meet, page last time corresponding to pre-conditioned superseded weighted value be performed for read operation, then according to formula ω
2=ω
1* TLC-1 calculates the superseded weighted value of the page this page current.
Wherein,
for temporal locality coefficient; ω
1for the page last time not meeting pre-conditioned superseded weighted value corresponding is performed the superseded weighted value after operation; μ is read-write otherness coefficient; ω
2for the current superseded weight not meeting the page corresponding to pre-conditioned superseded weighted value.
205, the page meeting pre-conditioned superseded weighted value corresponding is deleted from buffer zone.
Due to the limited space of buffer zone, therefore, if the space that the buffer zone that takies of the long-time not accessed page is too much, the page making some accessed cannot be stored in buffer zone, causes the performance of buffer zone to reduce.Therefore, buffer zone timing scans the page stored in this buffer zone, and deletes the long-time not accessed page.
As an embodiment of the present embodiment, when the superseded weighted value of the page meets pre-conditioned, the page is deleted from buffer zone.
In such scheme, different from the expense of deleting needed for the non-dirty page owing to deleting the dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, therefore, to the page performing write operation with to performing the superseded weight radix of the page of read operation, the first default value, the second default value set respectively, makes buffer zone preferentially delete the less page of expense; When carrying out eliminating scanning at every turn, according to formula ω
2=ω
1* TLC-μ or formula ω
2=ω
1* TLC-1 calculates the superseded weight of the page, the page residence time in the buffer and the expense of deleting needed for the page are fully taken into account, the not accessed page is eliminated by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
This enforcement provides the another kind of method for data cached process, and the method describes when the superseded weighted value of the page has default higher limit, the computing method that the superseded weight of the page is concrete, as shown in Figure 4, comprises the following steps:
401, the superseded weight radix of the page is determined.
Buffer zone is eliminated weighted value by the page and is determined whether the page of correspondence to delete from buffer zone, the superseded weighted value of the page is larger, this page is got over needs and is stored in the buffer, and the superseded weighted value of the page is less, and this page more should be deleted by from buffer zone.Fig. 5 is the constitutional diagram of buffer zone and the page.
After the page is performed corresponding operating, the superseded weighted value of this page can change, and the process of change is for carry out corresponding computing based on superseded weight radix.Eliminate weight radix be the page initially stored in buffer zone time superseded weighted value.
The preset value of the present embodiment to the superseded weight radix of the page is not construed as limiting, and can set according to actual needs.
As an embodiment of the present embodiment, if when the page reads in buffer zone for the first time, the superseded weight radix of the page is preset value, such as: the superseded weight radix of the page is set to 1.
402, eliminate weight for the page and determine superseded weight higher limit.
If after the page is repeatedly accessed in section sometime, this page is long-time not accessed after that period of time, now, the superseded weighted value of this page may be accumulated to very large numerical value, when causing buffer zone to carry out eliminating scanning to this page, the superseded weighted value of this page is reduced to the overlong time of satisfied deletion condition, this long-time not accessed page can not be deleted in time from buffer zone.
In order to make the page after repeatedly being accessed, the superseded weighted value of this page is not infinitely great, eliminates weight and determines superseded weight higher limit, superseded weighted value is no longer increased after being added to superseded weight higher limit for the page.
Different from the expense of deleting needed for the non-dirty page owing to deleting the dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, such as: the required time deleting a dirty page is longer than the time of the non-dirty page of deletion one, therefore, buffer zone is paid the utmost attention in delete buffer long-time not accessed, and the page that when deleting, expense is less, therefore, with the page being performed write operation, superseded weight higher limit is arranged respectively to the page being performed read operation.
As a kind of embodiment of the present embodiment, when the page last time be performed for write operation time, according to formula ω
3=μ * Threshold calculates the superseded weight higher limit of this page in buffer zone; When the page last time be performed for read operation time, according to formula ω
3=Threshold calculates the superseded weight higher limit of this page in buffer zone.
Wherein, ω
3for the page eliminates the higher limit of weight; Threshold is predetermined coefficient; μ (μ>=1) is read-write otherness coefficient.
The size of the present embodiment to Threshold does not limit, and can set according to actual needs.
403, after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value, the superseded weighted value of current page is obtained.
The page stored in buffer zone is just at the accessed page, in order to make this page do not deleted by from buffer zone, after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value, obtains the superseded weighted value of current page.
The present embodiment is not construed as limiting the first default value, can set according to actual needs.
As an embodiment of the present embodiment, after the page is performed operation, by the superseded weighted value of this page cumulative 1 at every turn.It is no longer cumulative after superseded weight is added to superseded weight higher limit.
404, judge whether eliminate weighted value meets pre-conditioned.
When carrying out in buffer zone eliminating scanning, first judge whether eliminate weighted value meets pre-conditioned.
The pre-conditioned of superseded weighted value to the page does not limit the present embodiment, can set according to actual needs.
As an embodiment of the present embodiment, judge whether the superseded weighted value of the page equals 0, if the superseded weighted value of the page equals 0, namely meet pre-conditioned, then perform step 406; If the superseded weighted value of the page is not equal to 0, namely do not meet pre-conditioned, then perform step 405.
405, when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence.
In order to make the long-time not accessed page can not take the space of buffer zone, when carrying out eliminating scanning at every turn, subtract the second default value by not meeting pre-conditioned weighted value.
The present embodiment is not construed as limiting the second default value, can set according to actual needs.
As an embodiment of the present embodiment, when carrying out eliminating scanning at every turn, subtract 1 by not meeting pre-conditioned superseded weighted value.
406, the page meeting pre-conditioned superseded weighted value corresponding is deleted from buffer zone.
Due to the limited space of buffer zone, therefore, if the space that the buffer zone that takies of the long-time not accessed page is too much, the page making some accessed cannot be stored in buffer zone, causes the performance of buffer zone to reduce.Therefore, buffer zone timing scans the page stored in this buffer zone, and deletes the long-time not accessed page.
As an embodiment of the present embodiment, when the superseded weighted value of the page meets pre-conditioned, the page is deleted from buffer zone.
In such scheme, weight higher limit is eliminated by the superseded weight setting for the page, make those the short time by the superseded weighted value of the page long-time not accessed after repeatedly accessing for infinitely great, the superseded page weight value of this page can be reduced to and meet pre-conditioned numerical value by buffer zone at short notice, the not accessed page can be deleted by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
The present embodiment provides the another kind of method for data cached process, and the method describes when carrying out eliminating scanning at every turn, is deleted by the page being performed read operation, as shown in Figure 6, comprise the following steps from buffer zone:
601, the superseded weight radix being performed the page of read operation is defined as 0.
The superseded weight radix of the present embodiment to the page being performed read operation is not construed as limiting, and can set according to actual needs.
602, the superseded weight higher limit being performed the page of read operation is set to 0.
The superseded weight higher limit of the present embodiment to the page being performed read operation is not construed as limiting, and can set according to actual needs.
As an embodiment of the present embodiment, in order to when carrying out eliminating scanning at every turn, the page being performed read operation is deleted from buffer zone, the superseded weight higher limit being performed the page of read operation is set to 0.
Because the weight radix being performed the page of read operation is defined as 0, and the superseded weight higher limit being performed the page of read operation is set to 0, therefore, is performed the superseded weight of the page of read operation to being always 0.
603, step 403 is performed to 406.
Delete the dirty page different from the expense of deleting needed for the non-dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, such as: the required time deleting a dirty page is longer than the time of the non-dirty page of deletion one, therefore, buffer zone is paid the utmost attention in delete buffer long-time not accessed, and the page that when deleting, expense is less.
When buffer zone carries out eliminating scanning, owing to being performed the superseded weight of the page 1 of read operation to being always 0, therefore, the page being performed read operation is deleted by from buffer zone.
The delet method of the present embodiment to the page being performed write operation is not construed as limiting, and can be any means well known to those skilled in the art.
In such scheme, fewer than deleting the time being performed the page of write operation owing to deleting the time being performed the page of read operation, therefore, the superseded weight higher limit being performed the page of read operation is set to 0, make, when carrying out eliminating scanning at every turn, the page being performed read operation to be deleted from buffer zone, has both released the space of buffer zone, reduce again the expense of the buffer block deletion page, the performance of the buffer zone of raising.
The present embodiment provides a kind of device for data cached process, as shown in Figure 7, comprising: determining unit 71, summing elements 72, first computing unit 73, second computing unit 74, delete cells 75.
Wherein, determining unit 71, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the page.
Summing elements 72, for after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value.
First computing unit 73, if there is default higher limit for eliminating weighted value, then after superseded weighted value reaches higher limit, stop cumulative superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence.
Second computing unit 74, if for the higher limit of eliminating weighted value Non-precondition, then when carrying out eliminating scanning at every turn, calculating with the mode that the time that the corresponding page stores in the buffer is inversely proportional to according to not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of this page current.
Delete cells 75, for deleting the page meeting pre-conditioned superseded weighted value corresponding from buffer zone.
After adopting such scheme, by arranging superseded weight higher limit respectively to the page of different attribute, make those the short time by the superseded weighted value of the page long-time not accessed after repeatedly accessing for infinitely great, the superseded page weight value of this page can be reduced to and meet pre-conditioned numerical value by buffer zone at short notice; Or, the mode that the time stored in the buffer according to superseded weighted value and the page is inversely proportional to calculates superseded weighted value, the page residence time in the buffer and the expense of deleting needed for the page are fully taken into account, the not accessed page is eliminated by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
As the improvement of embodiment, the present embodiment provides the another kind of device for data cached process, as shown in Figure 8, comprising: determining unit 81, summing elements 82, second computing unit 83, delete cells 84.
Wherein, determining unit 81 comprises: first arranges module 811.
Summing elements 82 comprises: accumulator module 821.
Second computing unit 83 comprises: the first computing module 831, second computing module 832.
Determining unit 81, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the page.
Concrete, if eliminate the higher limit of weighted value Non-precondition, first arranges module 811, if for when the page reads in buffer zone for the first time, what the page was performed is read operation, then the superseded weight radix of the page is 1, if when the page reads in buffer zone for the first time, what the page was performed is write operation, then the superseded weight radix of the page is μ.
Buffer zone is eliminated weighted value by the page and is determined whether the page of correspondence to delete from buffer zone, and the superseded weighted value of the page is larger, and this page is got over needs and is stored in the buffer, and the superseded weight of the page is less, and this page more should be deleted by from buffer zone.
After the page is performed corresponding operating, the superseded weighted value of this page can change, and the process of change is for carry out corresponding computing based on superseded weight radix.Eliminate weight radix be the page initially stored in buffer zone time superseded weighted value.
Summing elements 82, for after the page is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value.
As an embodiment of the present embodiment, summing elements is according to formula ω
1=R+ μ * W to corresponding accessed after the superseded weighted value of the page to add up corresponding first default value.Wherein, R is that the page is performed read operation number of times; W is that the page is performed write operation number of times; ω
1for the page last time is performed the superseded weighted value after operation.
Concrete, accumulator module 821, for after the page is performed read operation at every turn, by the superseded weight radix of the page cumulative 1, after the page is performed write operation at every turn, add up the superseded weight radix of the page μ.
Second computing unit 83, if for the higher limit of eliminating weighted value Non-precondition, then when carrying out eliminating scanning at every turn, calculating with the mode that the time that the corresponding page stores in the buffer is inversely proportional to according to not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of this page current.
As an embodiment of the present embodiment, when carrying out eliminating scanning at every turn, if the page does not have accessed within certain period, the time that the page stores in the buffer is longer, then the superseded weighted value of this page is less; The time that the page stores in the buffer is shorter, then the superseded weighted value of this page is larger.
Concrete, the first computing module 831, if be write operation for what do not meet that page last time corresponding to pre-conditioned superseded weighted value be performed, then according to formula ω
2=ω
1* TLC-μ calculates the superseded weighted value of this page current.
Second computing module 832, if for do not meet that page last time corresponding to pre-conditioned superseded weighted value be performed for read operation, then according to formula ω
2=ω
1* TLC-1 calculates the current superseded weighted value of this page.
Wherein,
for temporal locality coefficient; ω
1for the page last time not meeting pre-conditioned superseded weighted value corresponding is performed the superseded weighted value after operation; μ is read-write otherness coefficient; ω
2for the current superseded weight not meeting the page corresponding to pre-conditioned superseded weighted value.
Delete cells 84, for deleting the page meeting pre-conditioned superseded weighted value corresponding from buffer zone.
Due to the limited space of buffer zone, therefore, if the space that the buffer zone that takies of the long-time not accessed page is too much, the page making some accessed cannot be stored in buffer zone, causes the performance of buffer zone to reduce.Therefore, buffer zone timing scans the page stored in this buffer zone, and deletes the long-time not accessed page.
As an embodiment of the present embodiment, if the superseded weighted value of the page is not more than 0, namely meet pre-conditioned; If the superseded weighted value of the page is greater than 0, namely do not meet pre-conditioned, the page meeting pre-conditioned superseded weighted value corresponding is deleted by delete cells from buffer zone.
As an embodiment of the present embodiment, when the superseded weighted value of the page meets pre-conditioned, the page is deleted by delete cells from buffer zone.
In such scheme, different from the expense of deleting needed for the non-dirty page owing to deleting the dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, therefore, to the page performing write operation with to performing the superseded weight radix of the page of read operation, the first default value, the second default value set respectively, makes buffer zone preferentially delete the less page of expense; When carrying out eliminating scanning at every turn, according to formula ω
2=ω
1* TLC-μ or formula ω
2=ω
1* TLC-1 calculates the superseded weight of the page, the page residence time in the buffer and the expense of deleting needed for the page are fully taken into account, the not accessed page is eliminated by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
The present embodiment provides the another kind of device for data cached process, as shown in Figure 9, comprising: determining unit 91, the 3rd computing unit 92, the 4th computing unit 93, summing elements 94, first computing unit 95, delete cells 96.
Wherein, determining unit 91, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the page.
Further alternative, if eliminate weighted value to have default higher limit, the superseded weight radix of the page is defined as preset value by determining unit.
Be a kind of embodiment as the present embodiment, the superseded weight radix of the page is defined as 1 by determining unit.
3rd computing unit 92, for when the page last time be performed for write operation time, according to formula ω
3=μ * Threshold calculates the superseded weight higher limit of this page in buffer zone.
In order to make the page after repeatedly being accessed, the superseded weighted value of this page is not infinitely great, eliminates weight and determines superseded weight higher limit, superseded weighted value is no longer increased after being added to superseded weight higher limit for the page.
Different from the expense of deleting needed for the non-dirty page owing to deleting the dirty page, the expense of deleting the dirty page is greater than the expense of deleting the non-dirty page, such as: the required time deleting a dirty page is longer than the time of the non-dirty page of deletion one, therefore, buffer zone is paid the utmost attention in delete buffer long-time not accessed, and the page that when deleting, expense is less, therefore, respectively with the page setup being performed write operation, weight higher limit is eliminated to the page being performed read operation by the 3rd computing unit, the 4th computing unit.
4th computing unit 93, for when the page last time be performed for read operation time, according to formula ω
3=Threshold calculates the superseded weight higher limit of this page in buffer zone.
Wherein, ω
3for the page eliminates the higher limit of weight; Threshold is predetermined coefficient; μ is read-write otherness coefficient.
Summing elements 94, for after face is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value.
Be a kind of embodiment as the present embodiment, after the page is performed operation at every turn, summing elements is by the superseded weighted value of this page cumulative 1.It is no longer cumulative after superseded weight is added to superseded weight higher limit.
First computing unit 95, if there is default higher limit for eliminating weighted value, then after superseded weighted value reaches higher limit, stop cumulative superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence.
In order to make the long-time not accessed page can not take the space of buffer zone, when carrying out eliminating scanning at every turn, the first computing unit subtracts the second default value by not meeting pre-conditioned weighted value.
As an embodiment of the present embodiment, when carrying out eliminating scanning at every turn, the first computing unit subtracts 1 by not meeting pre-conditioned superseded weighted value.
Delete cells 96, for deleting the page meeting pre-conditioned superseded weighted value corresponding from buffer zone.
Due to the limited space of buffer zone, therefore, if the space that the buffer zone that takies of the long-time not accessed page is too much, the page making some accessed cannot be stored in buffer zone, causes the performance of buffer zone to reduce.Therefore, buffer zone timing scans the page stored in this buffer zone, and deletes the long-time not accessed page.
As an embodiment of the present embodiment, if the superseded weighted value of the page equals 0, namely meet pre-conditioned; If the superseded weighted value of the page is not equal to 0, namely do not meet pre-conditioned, the page meeting pre-conditioned superseded weighted value corresponding is deleted by delete cells from buffer zone.
In such scheme, weight higher limit is eliminated by the superseded weight setting for the page, make those the short time by the superseded weighted value of the page long-time not accessed after repeatedly accessing for infinitely great, the superseded page weight value of this page can be reduced to and meet pre-conditioned numerical value by buffer zone at short notice, the not accessed page can be eliminated by buffer zone in time from buffer zone, the space in buffer release district, and then the performance improving buffer zone.
The present embodiment provides a kind of device for data cached process, as shown in Figure 10, comprising: determining unit 101, the 4th computing unit 102, summing elements 103, first computing unit 104, delete cells 105.
Determining unit 101, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the page.
Further alternative, the superseded weight radix being performed the page of read operation is defined as 0 by determining unit.
4th computing unit 103, for when the page last time be performed for read operation time, the superseded weight higher limit of this page is set to 0.
Summing elements 104, for after face is performed operation at every turn, by cumulative for the superseded weight radix of the page the first default value.
Be a kind of embodiment as the present embodiment, after the page is performed operation at every turn, summing elements is by the superseded weighted value of this page cumulative 1.It is no longer cumulative after superseded weight is added to superseded weight higher limit.
Because the weight radix being performed the page of read operation is defined as 0, and the superseded weight higher limit being performed the page of read operation is set to 0, therefore, is performed the superseded weight of the page of read operation to being always 0.
First computing unit 105, if there is default higher limit for eliminating weighted value, then after superseded weighted value reaches higher limit, stop cumulative superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence.
In order to make the long-time not accessed page can not take the space of buffer zone, when carrying out eliminating scanning at every turn, the first computing unit subtracts the second default value by not meeting pre-conditioned weighted value.
As an embodiment of the present embodiment, when carrying out eliminating scanning at every turn, the first computing unit subtracts 1 by not meeting pre-conditioned superseded weighted value.
Delete cells 106, for deleting the page meeting pre-conditioned superseded weighted value corresponding from buffer zone.
When buffer zone carries out eliminating scanning, owing to being performed the superseded weight of the page of read operation to being always 0, therefore, the deleted unit of the page being performed read operation is deleted from buffer zone.
In such scheme, fewer than deleting the time being performed the page of write operation owing to deleting the time being performed the page of read operation, therefore, the superseded weight higher limit being performed the page of read operation is set to 0, make, when carrying out eliminating scanning at every turn, the page being performed read operation to be deleted from buffer zone, has both released the space of buffer zone, there is the expense reducing the buffer block deletion page, the performance of the buffer zone of raising.
Through the above description of the embodiments, those skilled in the art can be well understood to the mode that the present invention can add required common hardware by software and realize, and can certainly pass through hardware, but in a lot of situation, the former is better embodiment.Based on such understanding, technical scheme of the present invention can embody with the form of software product the part that prior art contributes in essence in other words, this computer software product is stored in the storage medium that can read, as the floppy disk of computing machine, hard disk or CD etc., comprise some instructions and perform method described in each embodiment of the present invention in order to make a computer equipment (can be personal computer, server, or the network equipment etc.).
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; change can be expected easily or replace, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should described be as the criterion with the protection domain of claim.
Claims (10)
1., for a method for data cached process, it is characterized in that,
When the page reads in buffer zone for the first time, determine the superseded weight radix of the described page;
After the described page is performed operation, by cumulative for the superseded weight radix of the described page the first default value at every turn;
If described superseded weighted value has default higher limit, then after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence;
If the higher limit of described superseded weighted value Non-precondition, then when carrying out eliminating scanning at every turn, do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, obtain the superseded weighted value of this page current;
The page meeting described pre-conditioned superseded weighted value corresponding is deleted from described buffer zone;
Wherein, during the higher limit of described superseded weighted value Non-precondition, described when the page reads in buffer zone for the first time, determine that the superseded weight radix of the described page comprises:
If when the page reads in buffer zone for the first time, what the described page was performed is read operation, then the superseded weight radix of the described page is 1, if when the page reads in buffer zone for the first time, what the described page was performed is write operation, then the superseded weight radix of the described page is μ;
Describedly do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, the superseded weighted value obtaining this page current comprises:
Do not meet if described that page last time corresponding to described pre-conditioned superseded weighted value be performed for write operation, then according to formula ω
2=ω
1* TLC-μ calculates the superseded weighted value of this page current;
Do not meet if described that page last time corresponding to described pre-conditioned superseded weighted value be performed for read operation, then according to formula ω
2=ω
1* TLC-1 calculates the current superseded weighted value of this page;
Wherein,
for temporal locality coefficient; ω
1for the described page last time not meeting described pre-conditioned superseded weighted value corresponding is performed the superseded weighted value after operation; μ is read-write otherness coefficient; ω
2for not meeting the superseded weight of the page corresponding to described pre-conditioned superseded weighted value described in current.
2. the method for data cached process according to claim 1, is characterized in that, described after the described page is performed operation at every turn, is comprised by cumulative for the superseded weight radix of the described page the first default value:
After the described page is performed read operation at every turn, by the superseded weight radix of the described page cumulative 1, after the described page is performed write operation at every turn, add up the superseded weight radix of the described page μ.
3. the method for data cached process according to claim 1, is characterized in that, when described superseded weighted value has default higher limit, the superseded weight radix of the described page is preset value.
4. the method for data cached process according to claim 3, it is characterized in that, described after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, to not meet before pre-conditioned superseded weighted value subtracts the second default value, described method comprises:
When the described page last time be performed for write operation time, according to formula ω
3=μ * Threshold calculates the superseded weight higher limit of this page in buffer zone;
When the described page last time be performed for read operation time, according to formula ω
3=Threshold calculates the superseded weight higher limit of this page in buffer zone;
Wherein, ω
3for the described page eliminates the higher limit of weight; Threshold is predetermined coefficient; μ is read-write otherness coefficient.
5. the method for data cached process according to claim 4, it is characterized in that, if when the page reads in buffer zone for the first time, what the described page was performed is read operation, then the superseded weight radix of the described page is 0, and the superseded weight higher limit of this page is 0.
6., for a device for data cached process, it is characterized in that,
Determining unit, for when the page reads in buffer zone for the first time, determines the superseded weight radix of the described page;
Summing elements, for after the described page is performed operation at every turn, by cumulative for the superseded weight radix of the described page the first default value;
First computing unit, if there is default higher limit for described superseded weighted value, then after described superseded weighted value reaches described higher limit, stop cumulative described superseded weight radix, and when carrying out eliminating scanning at every turn, subtracting the second default value by not meeting pre-conditioned superseded weighted value, obtaining the superseded weighted value of the page of current correspondence;
Second computing unit, if for the higher limit of described superseded weighted value Non-precondition, then when carrying out eliminating scanning at every turn, do not meet described pre-conditioned superseded weighted value calculate with the mode that the time that the corresponding page stores in described buffer zone is inversely proportional to according to described, obtain the superseded weighted value of this page current;
Delete cells, for deleting the page meeting described pre-conditioned superseded weighted value corresponding from described buffer zone;
Wherein, described determining unit comprises:
First arranges module, if for when the page reads in buffer zone for the first time, what the described page was performed is read operation, then the superseded weight radix of the described page is 1, if when the page reads in buffer zone for the first time, what the described page was performed is write operation, then the superseded weight radix of the described page is μ;
Described second computing unit comprises:
First computing module, if for described do not meet that page last time corresponding to described pre-conditioned superseded weighted value be performed for write operation, then according to formula ω
2=ω
1* TLC-μ calculates the superseded weighted value of this page current;
Second computing module, if for described do not meet that page last time corresponding to described pre-conditioned superseded weighted value be performed for read operation, then according to formula ω
2=ω
1* TLC-1 calculates the current superseded weighted value of this page;
Wherein,
for temporal locality coefficient; ω
1for the described page last time not meeting described pre-conditioned superseded weighted value corresponding is performed the superseded weighted value after operation; μ is read-write otherness coefficient; ω
2for not meeting the superseded weight of the page corresponding to described pre-conditioned superseded weighted value described in current.
7. the device for data cached process according to claim 6, is characterized in that, described summing elements comprises:
Accumulator module, for after the described page is performed read operation at every turn, by the superseded weight radix of the described page cumulative 1, after the described page is performed write operation at every turn, add up the superseded weight radix of the described page μ.
8. the device for data cached process according to claim 6, is characterized in that, when described superseded weighted value has default higher limit, the superseded weight radix of the described page is defined as preset value by described determining unit.
9. the device for data cached process according to claim 8, is characterized in that, described device also comprises:
3rd computing unit, for be performed when the described page last time for write operation time, according to formula ω
3=μ * Threshold calculates the superseded weight higher limit of this page in buffer zone;
4th computing unit, for be performed when the described page last time for read operation time, according to formula ω
3=Threshold calculates the superseded weight higher limit of this page in buffer zone;
Wherein, ω
3for the described page eliminates the higher limit of weight; Threshold is predetermined coefficient; μ is read-write otherness coefficient.
10. the device for data cached process according to claim 9, it is characterized in that, if when the page reads in buffer zone for the first time, what the described page was performed is read operation, then the superseded weight radix of the described page is defined as 0 by described determining unit, and the superseded weight higher limit of this page is calculated as 0 by described 4th computing unit.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110390186.2A CN102521162B (en) | 2011-11-30 | 2011-11-30 | Method and device for cache data processing |
| PCT/CN2012/085639 WO2013079014A1 (en) | 2011-11-30 | 2012-11-30 | Cached data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110390186.2A CN102521162B (en) | 2011-11-30 | 2011-11-30 | Method and device for cache data processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102521162A CN102521162A (en) | 2012-06-27 |
| CN102521162B true CN102521162B (en) | 2014-12-31 |
Family
ID=46292091
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110390186.2A Expired - Fee Related CN102521162B (en) | 2011-11-30 | 2011-11-30 | Method and device for cache data processing |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102521162B (en) |
| WO (1) | WO2013079014A1 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102521162B (en) * | 2011-11-30 | 2014-12-31 | 华为技术有限公司 | Method and device for cache data processing |
| CN106294200B (en) * | 2016-08-26 | 2019-02-19 | 昆明理工大学 | A kind of operating system page life cycle algorithm |
| CN108733701A (en) * | 2017-04-20 | 2018-11-02 | 杭州施强教育科技有限公司 | A kind of query page buffer control method applied to online education |
| CN108205501B (en) * | 2017-06-26 | 2020-08-07 | 珠海市魅族科技有限公司 | Memory recovery method and device, computer device and computer readable storage medium |
| CN109840163B (en) * | 2018-12-27 | 2022-05-24 | 西安紫光国芯半导体有限公司 | Nand-Flash error data redundancy replacement method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101008922A (en) * | 2007-01-26 | 2007-08-01 | 浙江大学 | Segmentation and paging data storage space management method facing heterogeneous polynuclear system |
| CN101443740A (en) * | 2006-05-17 | 2009-05-27 | 高通股份有限公司 | Method and system for maximum residency replacement of cache memory |
| CN101595459A (en) * | 2006-12-01 | 2009-12-02 | 美国日本电气实验室公司 | The method and system that is used for quick and efficient data management and/or processing |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7099999B2 (en) * | 2003-09-30 | 2006-08-29 | International Business Machines Corporation | Apparatus and method for pre-fetching data to cached memory using persistent historical page table data |
| US8473684B2 (en) * | 2009-12-22 | 2013-06-25 | International Business Machines Corporation | Delayed replacement of cache entries |
| WO2011103828A2 (en) * | 2011-04-18 | 2011-09-01 | 华为技术有限公司 | Data replacement method in system cache and multi-core communication processor |
| CN102521162B (en) * | 2011-11-30 | 2014-12-31 | 华为技术有限公司 | Method and device for cache data processing |
-
2011
- 2011-11-30 CN CN201110390186.2A patent/CN102521162B/en not_active Expired - Fee Related
-
2012
- 2012-11-30 WO PCT/CN2012/085639 patent/WO2013079014A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101443740A (en) * | 2006-05-17 | 2009-05-27 | 高通股份有限公司 | Method and system for maximum residency replacement of cache memory |
| CN101595459A (en) * | 2006-12-01 | 2009-12-02 | 美国日本电气实验室公司 | The method and system that is used for quick and efficient data management and/or processing |
| CN101008922A (en) * | 2007-01-26 | 2007-08-01 | 浙江大学 | Segmentation and paging data storage space management method facing heterogeneous polynuclear system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2013079014A1 (en) | 2013-06-06 |
| CN102521162A (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102521162B (en) | Method and device for cache data processing | |
| US9952970B2 (en) | Cache allocation for disk array | |
| CN107066397B (en) | Method, system, and storage medium for managing data migration | |
| CN106716386B (en) | Hardware assisted memory compression management using page filters and system MMU | |
| US10114749B2 (en) | Cache memory system and method for accessing cache line | |
| CN106648469B (en) | Cache data processing method and device and storage controller | |
| CN105302478B (en) | A kind of date storage method and electronic equipment | |
| JP6711121B2 (en) | Information processing apparatus, cache memory control method, and cache memory control program | |
| CN104572491A (en) | Read cache management method and device based on solid-state drive (SSD) | |
| CN103885728A (en) | Magnetic disk cache system based on solid-state disk | |
| EP3425513B1 (en) | Cache management method and apparatus for non-volatile storage device | |
| CN102999444A (en) | Method and device for replacing data in caching module | |
| KR20140035082A (en) | Method for managing memory | |
| CN107491272B (en) | Data migration method, device, equipment and storage medium | |
| CN104571944A (en) | Computer system, and arrangement of data control method | |
| CN104156323B (en) | A kind of adaptive read method of the data block length of cache memory and device | |
| CN109815425A (en) | Caching data processing method, device, computer equipment and storage medium | |
| CN110147331A (en) | Caching data processing method, system and readable storage medium storing program for executing | |
| CN110837480A (en) | Processing method and device of cache data, computer storage medium and electronic equipment | |
| CN108762916A (en) | A kind of EMS memory management process, device, equipment and computer readable storage medium | |
| CN109918352A (en) | The method of storage system and storing data | |
| CN102867046B (en) | Database optimizing method based on solid state hard disc and system | |
| CN111597129B (en) | Cache management method and device, storage medium and solid-state nonvolatile storage device | |
| CN109977074B (en) | HDFS-based LOB data processing method and device | |
| CN105260264A (en) | Snapshot implementation method and snapshot system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141231 Termination date: 20181130 |