CN104731722A - Method and device for management of cache pages - Google Patents
Method and device for management of cache pages Download PDFInfo
- Publication number
- CN104731722A CN104731722A CN201510182284.5A CN201510182284A CN104731722A CN 104731722 A CN104731722 A CN 104731722A CN 201510182284 A CN201510182284 A CN 201510182284A CN 104731722 A CN104731722 A CN 104731722A
- Authority
- CN
- China
- Prior art keywords
- fifo queue
- page
- buffer memory
- accessed
- treat
- 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.)
- Granted
Links
Abstract
The invention provides a method and a device for management of cache pages. The method includes: receiving a page access request with information of a to-be-accessed page; judging whether the to-be-accessed page indicated by the information of the to-be-accessed page is in cache or not (the cache consists of a plurality of first-in first-out queues for page storage according to a preset storage sequence); if the to-be-accessed page is not in the cache and the cache is not full, adding the to-be-accessed pages to the head of a first purpose first-in first-out queue (the first purpose first-in first-out queue is the first first-in first-out queue for page storage in the cache according to indication of storage sequence) so as to realize management of the cache pages.
Description
Technical field
The application relates to field of information management technical field, particularly relates to a kind of page management method for the buffer memory page and device.
Background technology
In computer realm, when needs visit data, in main memory, distribute spatial cache, the Data Dynamic in auxiliary depositing is called in the spatial cache of main memory to provide data access, this data processing method is called buffer memory.Caching technology has a wide range of applications in modern computer field (e.g., the field such as file system, database, the webserver, processor, operating system virtual memory).
In caching technology, data are divided into the block of certain size, and each piece is called as a page.Along with the widespread use of caching technology, the page management technology for the buffer memory page becomes more and more important, and it plays directive significance in caching technology application process.
Summary of the invention
In view of this, the application provides a kind of page management method for the buffer memory page and device, to realize the page management to the buffer memory page.
To achieve these goals, the technical scheme that provides of the embodiment of the present invention is as follows:
For a page management method for the buffer memory page, comprising:
Receive accessing page request, carry in described accessing page request and treat accessed page info;
That treats described in judgement that accessed page info indicates treats whether the accessed page is arranged in buffer memory, and the fifo queue that described buffer memory carries out page storage by several according to the storage order pre-set forms;
When described be not arranged in buffer memory until the accessed page time, judge that whether described buffer memory full;
When described buffer memory less than time, treat described the head that the accessed page is added into the first object fifo queue, described first object fifo queue is first fifo queue for storing the page in the described buffer memory of described storage order instruction.
Preferably, also comprise:
For each described fifo queue in described buffer memory, obtain the unique fifo queue mark corresponding with it;
By fifo queue mark described in each, indicate according to described storage order each described in fifo queue priority order from high to low that the page is stored, generate priority query.
Preferably, when described buffer memory is expired, the method also comprises:
According to from the afterbody of described priority query to the order of head, the fifo queue searching first instruction in described priority query is the element of non-NULL;
Delete the afterbody page of the fifo queue of the described element instruction found;
The head that the accessed page is added into described first object fifo queue is treated by described.
Preferably, when described be arranged in described buffer memory until the accessed page time, the method also comprises:
Treat that the fifo queue of the described buffer memory that the accessed page is arranged in from it is deleted by described;
The head that the accessed page is added into described first object fifo queue is treated by described;
Described in deleting, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to described priority query.
Preferably, also comprise:
Respectively for the afterbody page of each described fifo queue, judge whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set;
When described access duration exceedes described maximum access duration, by the head of afterbody page movement to the second object fifo queue of described fifo queue, wherein, described second object fifo queue is after storage order is positioned at described fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
For a page management device for the buffer memory page, comprising:
Request reception unit, for receiving accessing page request, carrying in described accessing page request and treating accessed page info;
First judging unit, treat whether the accessed page is arranged in buffer memory for what treat that accessed page info indicates described in judging, the fifo queue that described buffer memory carries out page storage by several according to the storage order pre-set forms;
Second judging unit, for when described in be not arranged in buffer memory until the accessed page time, judge that whether described buffer memory full;
First administrative unit, for when described buffer memory less than time, treat described the head that the accessed page is added into the first object fifo queue, described first object fifo queue is first fifo queue for storing the page in the described buffer memory of described storage order instruction.
Preferably, also comprise: priority query's generation unit,
Described priority query generation unit, for for each described fifo queue in described buffer memory, obtains the unique fifo queue mark corresponding with it; And, by fifo queue mark described in each, indicate according to described storage order each described in fifo queue priority order from high to low that the page is stored, generate priority query.
Preferably, also comprise: the second administrative unit,
Described second administrative unit, for when described in until the accessed page be not arranged in buffer memory and described buffer memory completely time, according to from the afterbody of described priority query to the order of head, the fifo queue searching first instruction in described priority query is the element of non-NULL; And, delete the afterbody page of the fifo queue of the described element instruction found; And, treat described the head that the accessed page is added into described first object fifo queue.
Preferably, also comprise: the 3rd administrative unit,
Described 3rd administrative unit, for when described in be arranged in described buffer memory until the accessed page time, treat that the fifo queue of the described buffer memory that the accessed page is arranged in from it is deleted by described; And, treat described the head that the accessed page is added into described first object fifo queue; And, described in deleting, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to described priority query.
Preferably, also comprise: adjustment unit,
Described adjustment unit, for respectively for the afterbody page of each described fifo queue, judges whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set; And, when described access duration exceedes described maximum access duration, by the head of afterbody page movement to the second object fifo queue of described fifo queue, wherein, described second object fifo queue is after storage order is positioned at described fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
The application provides a kind of page management method for the buffer memory page and device, the accessing page request treating accessed page info is carried by receiving, and judge that this treats that accessed page info indicates treat whether the accessed page is arranged in buffer memory (fifo queue that this buffer memory carries out page storage by several according to the storage order pre-set forms), and then when treating that the accessed page is not positioned at buffer memory, and buffer memory less than time, to treat that the accessed page is added into the head of the first object fifo queue (this first object fifo queue is first fifo queue for storing the page in the buffer memory of storage order instruction), to realize the page management to the buffer memory page.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only embodiments of the 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 the accompanying drawing provided.
A kind of page management method process flow diagram for the buffer memory page that Fig. 1 provides for the embodiment of the present application one;
The generation method flow diagram of a kind of priority query that Fig. 2 provides for the embodiment of the present application one;
The structural representation of a kind of page management device for the buffer memory page that Fig. 3 provides for the embodiment of the present application two.
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.
Embodiment one:
A kind of page management method process flow diagram for the buffer memory page that Fig. 1 provides for the embodiment of the present application one.
As shown in Figure 1, the method comprises:
S101, reception accessing page request, carry in accessing page request and treat accessed page info;
S102, judge to treat that accessed page info indicates and treat whether the accessed page is arranged in buffer memory, the fifo queue that buffer memory carries out page storage by several according to the storage order pre-set forms; When not being arranged in buffer memory until the accessed page, perform step S103;
In the embodiment of the present application, preferably, buffer memory carries out the storage of fifo queue realization to the page of page storage according to the storage order pre-set by several, namely, buffer memory carrys out memory page by arranging several fifo queues, and in accordance with the storage order pre-set between these fifo queues.
S103, judge that whether buffer memory is full; When buffer memory less than time, perform step S104;
In the embodiment of the present application, preferably, judge that whether buffer memory is full, also, judge whether can also continue memory page in buffer memory, when memory page can not be continued in buffer memory, then represent that buffer memory is full; When memory page can be continued in buffer memory, then represent buffer memory less than.
S104, will treat that the accessed page is added into the head of the first object fifo queue, the first object fifo queue is first fifo queue for storing the page in the buffer memory of storage order instruction.
In the embodiment of the present application, preferably, when be not positioned at buffer memory until the accessed page and buffer memory less than time, to treat that the accessed page is added into the first object fifo queue, concrete, this first object fifo queue is: first in the buffer memory of the above-mentioned storage order instruction the pre-set fifo queue for storing the page.
The application provides a kind of page management method for the buffer memory page, the accessing page request treating accessed page info is carried by receiving, and judge that this treats that accessed page info indicates treat whether the accessed page is arranged in buffer memory (fifo queue that this buffer memory carries out page storage by several according to the storage order pre-set forms), and then when treating that the accessed page is not positioned at buffer memory, and buffer memory less than time, to treat that the accessed page is added into the head of the first object fifo queue (this first object fifo queue is first fifo queue for storing the page in the buffer memory of storage order instruction), to realize the page management to the buffer memory page.
A kind of page management method for the buffer memory page provided to make the embodiment of the present application clearly, complete, preferably, on the basis of the page management method for the buffer memory page as shown in Figure 1 provided in the embodiment of the present application, provide a kind of generation method of priority query further.
The generation method flow diagram of a kind of priority query that Fig. 2 provides for the embodiment of the present application one.
As shown in Figure 2, the generation method of this priority query comprises:
S201, for each fifo queue in buffer memory, obtain corresponding with it unique fifo queue mark;
In the embodiment of the present application, preferably, can in advance for each fifo queue in buffer memory, arrange the unique fifo queue corresponding with this fifo queue to identify, and then can realize for each fifo queue in buffer memory, obtain the object of the unique fifo queue mark corresponding with it.
S202, each fifo queue to be identified, the priority order from high to low that each fifo queue according to storage order instruction stores the page, generate priority query.
In the embodiment of the present application, preferably, fifo queue corresponding with each fifo queue respectively can be utilized to identify, generate priority query, wherein, each element in priority query is fifo queue corresponding with each fifo queue in buffer memory respectively and identifies, and, putting in order that in this priority query, each fifo queue identifies is identical with the order that the fifo queue that above-mentioned storage order indicates stores the page (this to the order that the page stores is: the priority order from high to low stored the page).
In the embodiment of the present application, preferably, the generation method of above-mentioned priority query as shown in Figure 2 can perform in advance before performing a kind of page management method for the buffer memory page that provide as above-mentioned Fig. 1, to generate priority query in advance, also can perform in page management method implementation, the rise time inventor of relative priorities queue can set arbitrarily according to the demand of oneself, does not limit at this.
Further, in a kind of page management method for the buffer memory page that the embodiment of the present application provides, when not being positioned at buffer memory until the accessed page and buffer memory is expired, the method also comprises:
According to from the afterbody of priority query to the order of head, the fifo queue searching first instruction in priority query is the element of non-NULL; And, delete the afterbody page of the fifo queue of the element instruction found; And, will treat that the accessed page is added into the head of the first object fifo queue.
In the embodiment of the present application, preferably, when not being positioned at buffer memory until the accessed page and buffer memory is expired, then according to the order from the afterbody of priority query to head, search certain element (fifo queue that this element is corresponding is the fifo queue of first non-NULL found) in priority query.
In the embodiment of the present application, preferably, after find element from priority query, the page of the afterbody of the fifo queue of this element instruction found is deleted, and will treat that the accessed page is added into the head of the first object fifo queue.
Further, in a kind of page management method for the buffer memory page that the embodiment of the present application provides, when being arranged in buffer memory until the accessed page, the method also comprises:
To treat that the fifo queue of the buffer memory that the accessed page is arranged in from it is deleted; And, will treat that the accessed page is added into the head of the first object fifo queue; And, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to priority query by deleting.
Further, in a kind of page management method for the buffer memory page that the embodiment of the present application provides, also comprise:
Respectively for the afterbody page of each fifo queue, judge whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set; And, when accessing duration and exceeding maximum access duration, by the head of afterbody page movement to the second object fifo queue of fifo queue, wherein, second object fifo queue is after storage order is positioned at fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
In the embodiment of the present application, preferably, be previously provided with maximum access duration corresponding with each fifo queue respectively, whenever existence accessing page request, all can for the page of the afterbody of each fifo queue, judge whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set, when exceeding, then by the head of afterbody page movement to the second object fifo queue of fifo queue, wherein, second object fifo queue is after storage order is positioned at fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
Below be only the optimal way of the embodiment of the present application, inventor can according to the demand of oneself arrange arbitrarily execution " for the afterbody page of each fifo queue; judge its access duration whether exceed the maximum access duration corresponding with this fifo queue pre-set; and according to judged result perform respective process " time, do not limit at this.
In the embodiment of the present application, preferably, in fifo queue, the access duration of the page is the result of calculation that present system time deducts the last this page time of access.
A kind of page management method for the buffer memory page provided in the embodiment of the present application is particularly useful for the management of the buffer memory page in L2 cache, below be only the optimal way of the embodiment of the present application, inventor can arrange arbitrarily the applied environment of a kind of page management method for the buffer memory page that the embodiment of the present application provides according to the demand of oneself, do not limit at this.
By the above-mentioned further introduction to a kind of page management method for the buffer memory page that the embodiment of the present application provides, a kind of page management method for the buffer memory page that the embodiment of the present application is provided is more clear, complete, is convenient to those skilled in the art and understands.
Embodiment two:
The structural representation of a kind of page management device for the buffer memory page that Fig. 3 provides for the embodiment of the present application two.
As shown in Figure 3, this device comprises:
Request reception unit 1, for receiving accessing page request, carrying in accessing page request and treating accessed page info;
First judging unit 2, treat whether the accessed page is arranged in buffer memory for judging to treat that accessed page info indicates, the fifo queue that buffer memory carries out page storage by several according to the storage order pre-set forms;
Second judging unit 3, for when not being arranged in buffer memory until the accessed page, judges that whether buffer memory is full;
First administrative unit 4, for when buffer memory less than time, to treat that the accessed page is added into the head of the first object fifo queue, the first object fifo queue is first fifo queue for storing the page in the buffer memory of storage order instruction.
Further, what the embodiment of the present application provided a kind ofly also comprises: priority query's generation unit in the page management device of the buffer memory page, this priority query's generation unit, for for each fifo queue in buffer memory, obtain the unique fifo queue mark corresponding with it; And, each fifo queue is identified, the priority order from high to low that each fifo queue according to storage order instruction stores the page, generate priority query.
Further, it is a kind of in the page management device of the buffer memory page that the embodiment of the present application provides, also comprise: the second administrative unit, this second administrative unit, for when not being arranged in buffer memory until the accessed page and buffer memory is expired, according to from the afterbody of priority query to the order of head, the fifo queue searching first instruction in priority query is the element of non-NULL; And, delete the afterbody page of the fifo queue of the element instruction found; And, will treat that the accessed page is added into the head of the first object fifo queue.
Further, it is a kind of in the page management device of the buffer memory page that the embodiment of the present application provides, and also comprises: the 3rd administrative unit, the 3rd administrative unit, for when being arranged in buffer memory until the accessed page, will treat that the fifo queue of the buffer memory that the accessed page is arranged in from it is deleted; And, will treat that the accessed page is added into the head of the first object fifo queue; And, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to priority query by deleting.
Further, it is a kind of in the page management device of the buffer memory page that the embodiment of the present application provides, also comprise: adjustment unit, this adjustment unit, for the afterbody page respectively for each fifo queue, judge whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set; And, when accessing duration and exceeding maximum access duration, by the head of afterbody page movement to the second object fifo queue of fifo queue, wherein, second object fifo queue is after storage order is positioned at fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
The application provides a kind of page management device for the buffer memory page, the accessing page request treating accessed page info is carried by receiving, and judge that this treats that accessed page info indicates treat whether the accessed page is arranged in buffer memory (fifo queue that this buffer memory carries out page storage by several according to the storage order pre-set forms), and then when treating that the accessed page is not positioned at buffer memory, and buffer memory less than time, to treat that the accessed page is added into the head of the first object fifo queue (this first object fifo queue is first fifo queue for storing the page in the buffer memory of storage order instruction), to realize the page management to the buffer memory page.
In this instructions, each embodiment adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment identical similar portion mutually see.For device disclosed in embodiment, because it corresponds to the method disclosed in Example, so description is fairly simple, relevant part illustrates see method part.
Below be only the preferred implementation of the application, those skilled in the art understood or realizes the application.To be apparent to one skilled in the art to the multiple amendment of these embodiments, General Principle as defined herein when not departing from the spirit or scope of the application, can realize in other embodiments.Therefore, the application can not be restricted to these embodiments shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.
Claims (10)
1. for a page management method for the buffer memory page, it is characterized in that, comprising:
Receive accessing page request, carry in described accessing page request and treat accessed page info;
That treats described in judgement that accessed page info indicates treats whether the accessed page is arranged in buffer memory, and the fifo queue that described buffer memory carries out page storage by several according to the storage order pre-set forms;
When described be not arranged in buffer memory until the accessed page time, judge that whether described buffer memory full;
When described buffer memory less than time, treat described the head that the accessed page is added into the first object fifo queue, described first object fifo queue is first fifo queue for storing the page in the described buffer memory of described storage order instruction.
2. method according to claim 1, is characterized in that, also comprises:
For each described fifo queue in described buffer memory, obtain the unique fifo queue mark corresponding with it;
By fifo queue mark described in each, indicate according to described storage order each described in fifo queue priority order from high to low that the page is stored, generate priority query.
3. method according to claim 2, is characterized in that, when described buffer memory is expired, the method also comprises:
According to from the afterbody of described priority query to the order of head, the fifo queue searching first instruction in described priority query is the element of non-NULL;
Delete the afterbody page of the fifo queue of the described element instruction found;
The head that the accessed page is added into described first object fifo queue is treated by described.
4. method according to claim 3, is characterized in that, when described be arranged in described buffer memory until the accessed page time, the method also comprises:
Treat that the fifo queue of the described buffer memory that the accessed page is arranged in from it is deleted by described;
The head that the accessed page is added into described first object fifo queue is treated by described;
Described in deleting, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to described priority query.
5. the method according to claim 1-4 any one, is characterized in that, also comprises:
Respectively for the afterbody page of each described fifo queue, judge whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set;
When described access duration exceedes described maximum access duration, by the head of afterbody page movement to the second object fifo queue of described fifo queue, wherein, described second object fifo queue is after storage order is positioned at described fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
6., for a page management device for the buffer memory page, it is characterized in that, comprising:
Request reception unit, for receiving accessing page request, carrying in described accessing page request and treating accessed page info;
First judging unit, treat whether the accessed page is arranged in buffer memory for what treat that accessed page info indicates described in judging, the fifo queue that described buffer memory carries out page storage by several according to the storage order pre-set forms;
Second judging unit, for when described in be not arranged in buffer memory until the accessed page time, judge that whether described buffer memory full;
First administrative unit, for when described buffer memory less than time, treat described the head that the accessed page is added into the first object fifo queue, described first object fifo queue is first fifo queue for storing the page in the described buffer memory of described storage order instruction.
7. device according to claim 6, is characterized in that, also comprises: priority query's generation unit,
Described priority query generation unit, for for each described fifo queue in described buffer memory, obtains the unique fifo queue mark corresponding with it; And, by fifo queue mark described in each, indicate according to described storage order each described in fifo queue priority order from high to low that the page is stored, generate priority query.
8. device according to claim 7, is characterized in that, also comprises: the second administrative unit,
Described second administrative unit, for when described in until the accessed page be not arranged in buffer memory and described buffer memory completely time, according to from the afterbody of described priority query to the order of head, the fifo queue searching first instruction in described priority query is the element of non-NULL; And, delete the afterbody page of the fifo queue of the described element instruction found; And, treat described the head that the accessed page is added into described first object fifo queue.
9. device according to claim 8, is characterized in that, also comprises: the 3rd administrative unit,
Described 3rd administrative unit, for when described in be arranged in described buffer memory until the accessed page time, treat that the fifo queue of the described buffer memory that the accessed page is arranged in from it is deleted by described; And, treat described the head that the accessed page is added into described first object fifo queue; And, described in deleting, treat that the first in first out that the fifo queue of the accessed page is corresponding identifies the head moving to described priority query.
10. the device according to claim 6-9 any one, is characterized in that, also comprises: adjustment unit,
Described adjustment unit, for respectively for the afterbody page of each described fifo queue, judges whether its access duration exceedes the maximum access duration corresponding with this fifo queue pre-set; And, when described access duration exceedes described maximum access duration, by the head of afterbody page movement to the second object fifo queue of described fifo queue, wherein, described second object fifo queue is after storage order is positioned at described fifo queue, and the fifo queue adjacent with the storage order of this fifo queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510182284.5A CN104731722B (en) | 2015-04-17 | 2015-04-17 | A kind of page management method and device for the caching page |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510182284.5A CN104731722B (en) | 2015-04-17 | 2015-04-17 | A kind of page management method and device for the caching page |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104731722A true CN104731722A (en) | 2015-06-24 |
| CN104731722B CN104731722B (en) | 2018-08-07 |
Family
ID=53455629
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510182284.5A Expired - Fee Related CN104731722B (en) | 2015-04-17 | 2015-04-17 | A kind of page management method and device for the caching page |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104731722B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105589919A (en) * | 2015-09-18 | 2016-05-18 | 广州市动景计算机科技有限公司 | Method and device for processing webpage resource |
| CN107231284A (en) * | 2016-03-23 | 2017-10-03 | 阿里巴巴集团控股有限公司 | The sending method and terminal device of a kind of message |
| CN111124290A (en) * | 2019-12-06 | 2020-05-08 | 合肥沛睿微电子股份有限公司 | Redundancy method applied to flash memory storage device and flash memory storage device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1829979A (en) * | 2003-08-05 | 2006-09-06 | Sap股份公司 | A method of data caching |
| CN102012873A (en) * | 2010-11-24 | 2011-04-13 | 清华大学 | Cache system of Not AND (NAND) flash memory and cache method |
| CN102568570A (en) * | 2010-12-07 | 2012-07-11 | 上海华虹集成电路有限责任公司 | Method for rapidly writing flash medium through using annular queue based on SD (secure digital) interface |
-
2015
- 2015-04-17 CN CN201510182284.5A patent/CN104731722B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1829979A (en) * | 2003-08-05 | 2006-09-06 | Sap股份公司 | A method of data caching |
| CN102012873A (en) * | 2010-11-24 | 2011-04-13 | 清华大学 | Cache system of Not AND (NAND) flash memory and cache method |
| CN102568570A (en) * | 2010-12-07 | 2012-07-11 | 上海华虹集成电路有限责任公司 | Method for rapidly writing flash medium through using annular queue based on SD (secure digital) interface |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105589919A (en) * | 2015-09-18 | 2016-05-18 | 广州市动景计算机科技有限公司 | Method and device for processing webpage resource |
| CN107231284A (en) * | 2016-03-23 | 2017-10-03 | 阿里巴巴集团控股有限公司 | The sending method and terminal device of a kind of message |
| CN107231284B (en) * | 2016-03-23 | 2020-06-05 | 阿里巴巴集团控股有限公司 | Message sending method and terminal equipment |
| US11252121B2 (en) | 2016-03-23 | 2022-02-15 | Alibaba Group Holding Limited | Message sending method and terminal device |
| CN111124290A (en) * | 2019-12-06 | 2020-05-08 | 合肥沛睿微电子股份有限公司 | Redundancy method applied to flash memory storage device and flash memory storage device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104731722B (en) | 2018-08-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10268588B2 (en) | Methods of cache preloading on a partition or a context switch | |
| US9594521B2 (en) | Scheduling of data migration | |
| US8938603B2 (en) | Cache system optimized for cache miss detection | |
| KR101844521B1 (en) | Cross-page prefetching method, apparatus, and system | |
| US20190012258A1 (en) | Allocation of distributed data structures | |
| US20130262776A1 (en) | Managing Coherent Memory Between an Accelerated Processing Device and a Central Processing Unit | |
| KR101974491B1 (en) | Eviction system, eviction method and computer-readable medium | |
| CN110837513B (en) | Cache updating method, device, server and storage medium | |
| CN103677674B (en) | A kind of data processing method and device | |
| JP2012203729A (en) | Arithmetic processing unit and method for controlling arithmetic processing unit | |
| CN105094992A (en) | File request processing method and system | |
| CN104731722A (en) | Method and device for management of cache pages | |
| CN106250061A (en) | File download processing method and processing device | |
| CN104536911A (en) | Multi-path set-connection cache memory and processing method thereof | |
| CN106406762A (en) | A repeated data deleting method and device | |
| CN105359142B (en) | Hash connecting method and device | |
| CN104516822A (en) | Memory access method and device | |
| US9436608B1 (en) | Memory nest efficiency with cache demand generation | |
| US8543722B2 (en) | Message passing with queues and channels | |
| CN106156049A (en) | A kind of method and system of digital independent | |
| US20110161618A1 (en) | Assigning efficiently referenced globally unique identifiers in a multi-core environment | |
| US9639566B2 (en) | Method, apparatus and computer program product for improved storage of key-value pairs | |
| CN107748649B (en) | Method and device for caching data | |
| CN104731980A (en) | Method and device for management of cache pages | |
| CN116841624A (en) | Scheduling method and device of access instruction, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180807 Termination date: 20190417 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |