CN107291635A - A kind of buffer replacing method and device - Google Patents

A kind of buffer replacing method and device Download PDF

Info

Publication number
CN107291635A
CN107291635A CN201710458175.0A CN201710458175A CN107291635A CN 107291635 A CN107291635 A CN 107291635A CN 201710458175 A CN201710458175 A CN 201710458175A CN 107291635 A CN107291635 A CN 107291635A
Authority
CN
China
Prior art keywords
data block
sequencing
caching
temperature
cached
Prior art date
Application number
CN201710458175.0A
Other languages
Chinese (zh)
Inventor
张月辉
Original Assignee
郑州云海信息技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 郑州云海信息技术有限公司 filed Critical 郑州云海信息技术有限公司
Priority to CN201710458175.0A priority Critical patent/CN107291635A/en
Publication of CN107291635A publication Critical patent/CN107291635A/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02Addressing or allocation; Relocation
    • G06F12/08Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12Replacement control
    • G06F12/121Replacement control using replacement algorithms
    • G06F12/122Replacement control using replacement algorithms of the least frequently used [LFU] type, e.g. with individual count value

Abstract

The invention discloses a kind of buffer replacing method and device, wherein this method includes:Obtain the access temperature during each data block is cached at every grade;Temperature is accessed in caching according to most higher level from low to high or to be from high to low ranked up data block, obtains sequencing table;Since the next stage caching that most higher level caches untill most subordinate caches, successively using every grade of caching as when prime caching, obtain the sequencing table of the upper level caching cached when prime, count and temperature the first data block of identical is accessed in the sequencing table obtained, the first data block is ranked up from low to high or from high to low when prime cache access temperature according to the first data block in the sequencing table of acquisition, and keep other data block locations constant, obtain the sequencing table cached when prime;In most subordinate caches obtained sequencing table, the minimum preceding P data block of access temperature is chosen as data block to be replaced and realizes that correspondence caching is replaced.Buffer replacing method disclosed by the invention improves cache hit rate.

Description

A kind of buffer replacing method and device

Technical field

The present invention relates to field of cache, more particularly to a kind of buffer replacing method and device.

Background technology

An important part is cache memory in storage system.Cache memory is located at primary storage Between device and processor, with less capacity and faster speed.Current storage system is all organized using inclusive substantially The multilevel cache of structure, i.e. subordinate caching always include all caching data blocks during higher level caches.

In actual applications, it is sometimes necessary to carry out the replacement of caching data block, if to replace slow in subordinate's caching Deposit data block is, it is necessary to which the caching data block during higher level is cached is deactivated.And if the caching data block be higher level caching in Hotspot caching data block, it will influence higher level caching cache hit rate.In order to improve cache hit rate, it is necessary to select access The minimum caching data block of temperature, i.e., non-hot data block.

A kind of buffer replacing method is in the prior art:First, in most subordinate caches, (at least made recently with lru algorithm With algorithm) the non-hot data block that most subordinate caches is determined, the non-hot data block information of most subordinate caching is then sent step by step To higher level caching, higher level caching judge again most subordinate caching non-hot data block whether be this grade caching non-thermal point data It hurry up, after most higher level caching determines non-hot data block, non-hot data block information is sent to most subordinate by most higher level caching Caching, most subordinate caching is received after the non-hot data block information that most higher level caching is sent, and determines non-hot data block, and will It realizes that correspondence caching is replaced as data block to be replaced.

However, when choosing non-hot data block in aforementioned manners, process is cumbersome, inefficiency.

In summary, how quickly and accurately to choose non-hot data block and realize that caching replacement is those skilled in the art The current technical issues that need to address.

The content of the invention

The technical problems to be solved by the invention are to provide a kind of buffer replacing method, and it can solve quickly and accurately to select Negated hot spot data block realizes the technical problem that caching is replaced.Alternative is cached present invention also offers one kind.

In order to solve the above technical problems, the present invention provides a kind of buffer replacing method, including:

Obtain the access temperature during each data block is cached at every grade;

The order of temperature from low to high or from high to low is accessed in caching according to most higher level to be ranked up data block, is obtained Sequencing table;

Since the next stage caching that most higher level caches untill most subordinate caches, successively using every grade of caching as working as prime Caching, obtains the sequencing table obtained when the upper level caching that prime is cached, counts and temperature identical is accessed in the sequencing table obtained First data block, in the sequencing table of acquisition according to first data block accessed in being cached when prime temperature from low to high or First data block is ranked up from high to low, and keep obtain sequencing table in addition to first data block other count It is constant according to the position of block, obtain the sequencing table cached when prime;

In most subordinate caches obtained sequencing table, choose the minimum preceding P data block of access temperature and be used as number to be replaced Realize that correspondence caching is replaced according to block.

It is preferred that, the access temperature obtained during each data block is cached at every grade includes:

The accessed number of times in preset time period during each data block is cached at every grade is obtained, by each data block at every grade Access temperature of the accessed number of times as each data block in every grade of caching in caching.

It is preferred that, access the order of temperature from low to high or from high to low in the caching according to most higher level and data block is entered Row sequence, obtains sequencing table, including:

The initial sequencing table for including multiple sequence layers by the distribution of principle from top to bottom is set, according to most higher level's cache access The order of temperature from low to high or from high to low is ranked up to data block, and the data block after sequence is put according to a sequence layer The principle for putting a data block is aligned in initial sequencing table, obtains sequencing table.

It is preferred that, it is described to obtain also including after sequencing table:

The sequence layer for placing access temperature identical data block is merged into same sequence layer.

Alternative is cached present invention also offers one kind, including:

Acquisition module, for obtaining the access temperature during each data block is cached at every grade;

First order module, for accessing the order logarithm of temperature from low to high or from high to low in being cached according to most higher level It is ranked up according to block, obtains sequencing table;

Second order module, for untill most subordinate caches, successively will since the next stage caching that most higher level caches Every grade of caching obtains the sequencing table obtained when the upper level caching that prime is cached, counts the sequence obtained as when prime caching Temperature the first data block of identical is accessed in table, in the sequencing table of acquisition according to first data block in being cached when prime Access temperature from low to high or to be from high to low ranked up first data block, and keep in the sequencing table obtained except described The position of other outer data blocks of first data block is constant, obtains the sequencing table cached when prime;

Module is chosen, used in caching obtained sequencing table in most subordinate, chooses and accesses the minimum preceding P data block of temperature Realize that correspondence caching is replaced as data block to be replaced.

It is preferred that, the acquisition module includes:

Acquiring unit, will be every for obtaining the accessed number of times during each data block is cached at every grade in preset time period Access temperature of the accessed number of times of the individual data block in every grade of caching as each data block in every grade of caching.

It is preferred that, first order module includes:

Sequencing unit, the initial sequencing table of multiple sequence layers by the distribution of principle from top to bottom is included for setting, according to The most order of higher level's cache access temperature from low to high or from high to low is ranked up to data block, and the data block after sequence is pressed The principle for placing a data block according to a sequence layer is aligned in initial sequencing table, obtains sequencing table.

It is preferred that, in addition to:

Layer merging module, for after the sequencing unit obtains the sequencing table, temperature identical number to be accessed by placing Same sequence layer is merged into according to the sequence layer of block.

Buffer replacing method provided by the present invention, first obtains the access temperature during each data block is cached at every grade;So Afterwards in most higher level caches, the order of temperature from low to high or from high to low is accessed in being cached according to most higher level data block is carried out Sequence, obtains sequencing table;Then since the next stage caching that most higher level caches untill most subordinate caches, successively by every grade Caching obtains the sequencing table cached when the upper level of prime, counts in the sequencing table obtained and access temperature as when prime caching The data block of identical first, according to access temperature of first data block in being cached when prime, according to accessing temperature from low to high Or order from high to low, the first data block in the sequencing table of acquisition is ranked up, other data in addition to the first data block The sequence of block keeps constant, obtains the sequencing table cached when prime;Finally, in the sequencing table that most subordinate caches, choose and access The minimum preceding P data block of temperature realizes that correspondence caching is replaced as data block to be replaced.It is sharp due in being cached when prime Temperature identical data block is accessed with access temperature of the data block in caching when prime, in the sequencing table for caching most higher level to enter Row sequence so that the data block in most higher level caching has strict putting in order from low to high or from high to low, so that, The minimum preceding P data block of the accesss temperature chosen is during whole levels are cached, especially in the sequencing table that most subordinate caches The minimum data block of temperature is accessed in most higher level caching.Buffer replacing method provided by the present invention need not enter between caching Row data block information is interacted, and is simplified the process for choosing non-hot data block, is improved efficiency;And the inventive method selection The access temperature of non-hot data block is below in whole levels caching, especially in most higher level caching other data blocks access heat Degree, compared to existing technologies, judged result is more accurate.In summary, the buffer replacing method that the present invention is provided is solved How quickly and accurately to choose non-hot data block and realize the technical problem that caching is replaced.Caching provided by the present invention is replaced Device also solves corresponding technical problem.

Brief description of the drawings

In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this The embodiment of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can also basis The accompanying drawing of offer obtains other accompanying drawings.

Fig. 1 is provided the flow chart of buffer replacing method by a kind of embodiment of the invention;

Fig. 2 is provided the structural representation of caching alternative by a kind of embodiment of the invention.

Embodiment

The core of the present invention is to provide a kind of buffer replacing method, which solves and how quickly and accurately to choose non-hot Data block realizes the technical problem that caching is replaced.Another core of the present invention is to provide a kind of caching alternative.

In order that those skilled in the art are better understood from the present invention program, with reference to the accompanying drawings and detailed description The present invention is described in further detail.

Referring to Fig. 1, Fig. 1 is provided the flow chart of buffer replacing method by a kind of embodiment of the invention.

In the first embodiment, the buffer replacing method that the embodiment of the present invention is provided can include following step Suddenly:

Step S1:Obtain the access temperature during each data block is cached at every grade.

Because every grade of caching includes data block, although the total all data blocks cached including higher level of subordinate's caching, still Subordinate's caching may also contain higher level's caching without data block, and access temperature of each data block in every grade of caching can It can differ, so needing to obtain the access temperature during each data block is cached at every grade.Most of all, being cached using subordinate The access temperature of middle data block can be distinguished in higher level's caching and access temperature identical data block.

Step S2;The order of temperature from low to high or from high to low is accessed in caching according to most higher level to arrange data block Sequence, obtains sequencing table.

Although determining data block to be replaced in most subordinate caches, the failure of data block to be replaced can influence higher level The cache hit rate of caching, in order to improve cache hit rate, it is thus necessary to determine that the minimum data block of temperature is accessed in higher level's caching and is made For data block to be replaced, and in all higher level's cachings, the cache hit rate that data block to be replaced cache on most higher level influences Maximum, so being ranked up being cached by most higher level to data block.During sequence, it can be cached according to data block in most higher level In access temperature from low to high order sequence, can also according to data block most higher level cache in access temperature by height to Low order sequence, is not limited here;In addition, the data block of whole should be included in most higher level caches obtained sequencing table, Namely all data blocks that the whole levels cachings of reply are included in most higher level caches are ranked up, and are not wrapped if there is there is data block Be contained in most higher level caching or other any cachings, then can be by the data block in not comprising that of data block level caching Access temperature be defined as 0.Resulting sequencing table can be placed in most higher level caching, be easy to sort most higher level caching with it Table is corresponding, naturally it is also possible to chooses other modes of emplacements according to actual needs, is not specifically limited here.

Step S3:Since the next stage caching that most higher level caches untill most subordinate caches, every grade of caching is made successively To be cached when prime, the sequencing table obtained when the upper level caching that prime is cached is obtained, counts and heat is accessed in the sequencing table obtained Spend the data block of identical first, accessed in the sequencing table of acquisition in being cached when prime according to the first data block temperature by it is low to It is high or the first data block is ranked up from high to low, and keep in the sequencing table obtained other data blocks in addition to the first data block Position it is constant, obtain when prime cache sequencing table.

It is mentioned here to refer to the caching that is currently operated when prime is cached, mutually distinguished with the caching that is not operated.By It is ranked up in the data block cached to most higher level, and most higher level caching there may be access temperature the first data block of identical, So the access temperature according to the first data block in other grade of caching is needed, the first data in the sequencing table cached to most higher level The sequence of block is adjusted, and the sequence of other data blocks in addition to the first data block is constant.Here by the way of circulation, by The sequencing table of most higher level caching has been obtained in step S2, so here since the next stage caching that most higher level caches, until Untill most subordinate caches, successively using every grade of caching as when prime caching, acquisition caches the sequencing table of upper level caching when prime, Count and temperature the first data block of identical is accessed in the sequencing table obtained, utilize access of first data block in being cached when prime Temperature, is ranked up to the first data block in the sequencing table of acquisition, obtains sequencing table, until obtaining the sequence of most subordinate caching Untill table.

Step S4:In most subordinate caches obtained sequencing table, choose and access the minimum preceding P data block of temperature as treating Replacement data block realizes that correspondence caching is replaced.

The sequencing table that most subordinate caching is obtained is on the basis of most higher level's buffer sorting table, to utilize most higher level's buffer sorting Access temperature in access temperature of the temperature identical data block in other grade of caching, adjustment most higher level caching is accessed in table identical Data block sequence, keep in most higher level's sequencing table that other data block locations are constant to be obtained, the row that most subordinate caching is obtained It is in whole levels caching, especially most higher level accesses temperature in caching that the minimum preceding P data block of temperature is accessed in sequence table Less than the data block of other data blocks.In actual applications, the data to be replaced of varying number may be needed under different scenes Block, can the quantity of data block to be replaced according to actual needs determine P numerical value, so as to utilize the data to be replaced selected Block realizes that corresponding caching is replaced.If it should be noted that data block is to access temperature by height according to correspondence per minor sort To low sequence, then P data block is as data block to be replaced after choosing, if data block is according to correspondence visit per minor sort Ask what temperature sorted from low to high, then P data block is used as data block to be replaced before choosing.

Buffer replacing method provided by the present invention need not carry out data block information interaction between cache level, simplify The process of non-hot data block is chosen, efficiency is improved;And wait to replace determined by buffer replacing method provided by the present invention The access temperature for changing data block is below in whole level cachings, the access temperature of other data blocks especially in most higher level caching, Compared to existing technologies, judged result is more accurate.In summary, the buffer replacing method that provides of the present invention solve how Quickly and accurately choose non-hot data block and realize the technical problem that caching is replaced.Simultaneously as the caching provided through the present invention The access temperature for the data block that replacement method is selected is below in whole levels caching, especially other data blocks in most higher level caching Access temperature, the buffer replacing method that provides of the present invention improves cache hit rate.

In a kind of buffer replacing method provided in an embodiment of the present invention, step S1 can include:

The accessed number of times in preset time period during each data block is cached at every grade is obtained, by each data block at every grade Access temperature of the accessed number of times as each data block in every grade of caching in caching.

Wherein preset time period can be set according to actual needs, before such as current time in 10 minutes, here In preset time period, accessed number of times of each data block in every grade of caching, can quickly, accurately as temperature is accessed Determine each data block every grade cache in access temperature.In practical application, it can also be accessed with other method Temperature, such as can count during each data block is cached at every grade and be accessed time of 10 times, then 10 divided by will be counted Time, the access temperature of each data block in every grade of caching etc. is just obtained, within protection scope of the present invention.

In a kind of buffer replacing method provided in an embodiment of the present invention, step S2 can include:

The initial sequencing table for including multiple sequence layers by the distribution of principle from top to bottom is set, according to most higher level's cache access The order of temperature from low to high or from high to low is ranked up to data block, and the data block after sequence is put according to a sequence layer The principle for putting a data block is aligned in initial sequencing table, obtains sequencing table.

Sequence layer described here refers to each ranked object layer occupied in sequencing table.In selected and sorted mode When, can also can certainly there is it in the way of layer is sorted from top to bottom in the way of sequence layer is from left to right distributed He sorts a layer distribution mode, is not particularly limited here.It is preferred that, the sequence that the present embodiment selected and sorted layer is distributed from top to bottom Mode so that arrangement mode is simply easily realized.

When the data block after by sequence is put into sequencing table, it is typically chosen a sequence layer and places a data block, There can be other placement rules, be not particularly limited here.

In a kind of buffer replacing method provided in an embodiment of the present invention, obtain sorting the sequencing table that is distributed from top to bottom of layer it After can also include:

The sequence layer for placing access temperature identical data block is merged into same sequence layer.

When sequence, it can select access temperature identical data block being aligned to different sequences layers, can also It is aligned to same sequence layer.It is preferred that, the present embodiment is aligned to same sequence layer by temperature identical data block is accessed.This The benefit of sample arrangement is, when obtaining access temperature identical data block, it is thus only necessary to which selected and sorted layer mileage is big according to number of blocks In 1 sequence layer, it is not necessary to which whether the access temperature for comparing each two data block is identical, save acquisition and access temperature phase The acquisition time of same data block.

Alternative is cached present invention also offers one kind, it has the corresponding effect that the inventive method has.Refer to Fig. 2, Fig. 2 are provided the structural representation of caching alternative by a kind of embodiment of the invention.

A kind of caching alternative provided in an embodiment of the present invention can include:

Acquisition module A1, for obtaining the access temperature during each data block is cached at every grade;

First sequence modules A 2 is right for accessing the order of temperature from low to high or from high to low in being cached according to most higher level Data block is ranked up, and obtains sequencing table;

Second sequence modules A 3, for since next stage that most higher level cache caching untill most subordinate caching, successively Using every grade of caching as when prime caching, the sequencing table obtained when the upper level caching that prime is cached is obtained, the row obtained is counted Temperature the first data block of identical is accessed in sequence table, is visited in the sequencing table of acquisition according to the first data block in being cached when prime Ask that temperature is ranked up to the first data block from low to high or from high to low, and keep removing the first data block in the sequencing table obtained The position of other outer data blocks is constant, obtains the sequencing table cached when prime;

Modules A 4 is chosen, used in caching obtained sequencing table in most subordinate, chooses and accesses the minimum preceding P data of temperature Block realizes that correspondence caching is replaced as data block to be replaced.

In a kind of caching alternative provided in an embodiment of the present invention, acquisition module can include:

Acquiring unit, will be every for obtaining the accessed number of times during each data block is cached at every grade in preset time period Access temperature of accessed number of times of the individual data block in every grade of caching as each data block in every grade of caching.

In a kind of caching alternative provided in an embodiment of the present invention, the first order module can include:

Sequencing unit, the initial sequencing table of multiple sequence layers by the distribution of principle from top to bottom is included for setting, according to The most order of higher level's cache access temperature from low to high or from high to low is ranked up to data block, and the data block after sequence is pressed The principle for placing a data block according to a sequence layer is aligned in initial sequencing table, obtains sequencing table.

In a kind of caching alternative provided in an embodiment of the present invention, it can also include:

Layer merging module, after obtaining sequencing table in sequencing unit, temperature identical data block is accessed by placing Sequence layer merges into same sequence layer.

A kind of explanation for caching relevant portion in alternative provided in an embodiment of the present invention refers to the embodiment of the present invention The detailed description of corresponding part, will not be repeated here in a kind of buffer replacing method provided.In addition, the embodiment of the present invention is provided Above-mentioned technical proposal in the part consistent with corresponding to technical scheme realization principle in the prior art and unspecified, in order to avoid mistake Repeat more.

Specific case used herein is set forth to the principle and embodiment of the present invention, and above example is said The bright method and its core concept for being only intended to help to understand the present invention.It should be pointed out that for the ordinary skill of the art For personnel, under the premise without departing from the principles of the invention, some improvement and modification can also be carried out to the present invention, these improvement Also fallen into modification in the protection domain of the claims in the present invention.

Claims (8)

1. a kind of buffer replacing method, it is characterised in that including:
Obtain the access temperature during each data block is cached at every grade;
The order of temperature from low to high or from high to low is accessed in caching according to most higher level to be ranked up data block, is sorted Table;
Since the next stage caching that most higher level caches untill most subordinate caches, every grade of caching is delayed as when prime successively Deposit, obtain the obtained sequencing table of upper level caching cached when prime, count and temperature identical the is accessed in the sequencing table obtained One data block, in the sequencing table of acquisition according to first data block accessed in being cached when prime temperature from low to high or by It is high to Low that first data block is ranked up, and keep obtain sequencing table in addition to first data block other data The position of block is constant, obtains the sequencing table cached when prime;
In most subordinate caches obtained sequencing table, choose the minimum preceding P data block of access temperature and be used as data block to be replaced Realize that correspondence caching is replaced.
2. according to the method described in claim 1, it is characterised in that the access obtained during each data block is cached at every grade Temperature includes:
The accessed number of times in preset time period during each data block is cached at every grade is obtained, by each data block in every grade of caching In the accessed number of times as each data block every grade cache in access temperature.
3. method according to claim 1 or 2, it is characterised in that access temperature by low in the caching according to most higher level Data block is ranked up to order high or from high to low, sequencing table is obtained, including:
The initial sequencing table for including multiple sequence layers by the distribution of principle from top to bottom is set, according to most higher level's cache access temperature Order from low to high or from high to low is ranked up to data block, and the data block after sequence is placed into one according to a sequence layer The principle of individual data block is aligned in initial sequencing table, obtains sequencing table.
4. method according to claim 3, it is characterised in that described to obtain also including after sequencing table:
The sequence layer for placing access temperature identical data block is merged into same sequence layer.
5. one kind caching alternative, it is characterised in that including:
Acquisition module, for obtaining the access temperature during each data block is cached at every grade;
First order module, for accessing the order of temperature from low to high or from high to low in being cached according to most higher level to data block It is ranked up, obtains sequencing table;
Second order module, for since next stage that most higher level caches caching untill most subordinate caches, successively by every grade Caching obtains the sequencing table obtained when the upper level caching that prime is cached, counted in the sequencing table obtained as when prime caching Temperature the first data block of identical is accessed, is accessed in the sequencing table of acquisition according to first data block in being cached when prime Temperature is ranked up to first data block from low to high or from high to low, and keeps removing described first in the sequencing table obtained The position of other outer data blocks of data block is constant, obtains the sequencing table cached when prime;
Module is chosen, used in caching obtained sequencing table in most subordinate, chooses and accesses the minimum preceding P data block conduct of temperature Data block to be replaced realizes that correspondence caching is replaced.
6. device according to claim 5, it is characterised in that the acquisition module includes:
Acquiring unit, will be per number for obtaining the accessed number of times during each data block is cached at every grade in preset time period Access temperature of the accessed number of times as each data block in every grade of caching in being cached according to block at every grade.
7. the device according to claim 5 or 6, it is characterised in that first order module includes:
Sequencing unit, the initial sequencing table of multiple sequence layers by the distribution of principle from top to bottom is included for setting, according to most upper In level caching temperature order from low to high or from high to low is accessed to be ranked up data block, by the data block after sequence according to The principle that one sequence layer places a data block is aligned in initial sequencing table, obtains sequencing table.
8. device according to claim 7, it is characterised in that also include:
Layer merging module, for after the sequencing unit obtains the sequencing table, temperature identical data block to be accessed by placing Sequence layer merge into same sequence layer.
CN201710458175.0A 2017-06-16 2017-06-16 A kind of buffer replacing method and device CN107291635A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710458175.0A CN107291635A (en) 2017-06-16 2017-06-16 A kind of buffer replacing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710458175.0A CN107291635A (en) 2017-06-16 2017-06-16 A kind of buffer replacing method and device

Publications (1)

Publication Number Publication Date
CN107291635A true CN107291635A (en) 2017-10-24

Family

ID=60097287

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710458175.0A CN107291635A (en) 2017-06-16 2017-06-16 A kind of buffer replacing method and device

Country Status (1)

Country Link
CN (1) CN107291635A (en)

Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1677369A (en) * 2004-02-13 2005-10-05 英特尔公司 Method, system and apparatus for hierarchical cache line replacement
CN101576856A (en) * 2009-06-18 2009-11-11 浪潮电子信息产业股份有限公司 Buffer data replacement method based on access frequency within long and short cycle
CN102663115A (en) * 2012-04-16 2012-09-12 中国人民大学 Main memory database access optimization method on basis of page coloring technology
CN103106153A (en) * 2013-02-20 2013-05-15 哈尔滨工业大学 Web cache replacement method based on access density
WO2013089786A1 (en) * 2011-12-16 2013-06-20 Soft Machine, Inc. Cache replacement policy
CN103246616A (en) * 2013-05-24 2013-08-14 浪潮电子信息产业股份有限公司 Global shared cache replacement method for realizing long-short cycle access frequency
WO2014084918A1 (en) * 2012-11-27 2014-06-05 Intel Corporation Providing extended cache replacement state information
WO2014143053A1 (en) * 2013-03-15 2014-09-18 Intel Corporation Dead block predictors for cooperative execution in the last level cache
CN104111900A (en) * 2013-04-22 2014-10-22 中国移动通信集团公司 Method and device for replacing data in cache
CN104714753A (en) * 2013-12-12 2015-06-17 中兴通讯股份有限公司 Data access and storage method and device
CN104834609A (en) * 2015-05-31 2015-08-12 上海交通大学 Multi-level cache method based on historical upgrading and downgrading frequency
CN104834607A (en) * 2015-05-19 2015-08-12 华中科技大学 Method for improving distributed cache hit rate and reducing solid state disk wear
US20150286580A1 (en) * 2011-11-01 2015-10-08 International Business Machines Corporation Management of partial data segments in dual cache systems
CN105302493A (en) * 2015-11-19 2016-02-03 浪潮(北京)电子信息产业有限公司 Swap-in and swap-out control method and system for SSD cache in mixed storage array
CN105302741A (en) * 2014-07-04 2016-02-03 华为技术有限公司 Cache control method and apparatus
US20160062916A1 (en) * 2014-08-27 2016-03-03 The Board Trustees Of The Leland Stanford Junior University Circuit-based apparatuses and methods with probabilistic cache eviction or replacement
US20160239433A1 (en) * 2012-11-12 2016-08-18 Facebook, Inc. Predictive cache replacement
CN106527988A (en) * 2016-11-04 2017-03-22 郑州云海信息技术有限公司 SSD (Solid State Drive) data migration method and device
CN106569959A (en) * 2016-10-28 2017-04-19 郑州云海信息技术有限公司 Cache replacing method and system based on SSD
US20170168957A1 (en) * 2015-12-10 2017-06-15 Ati Technologies Ulc Aware Cache Replacement Policy

Patent Citations (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1677369A (en) * 2004-02-13 2005-10-05 英特尔公司 Method, system and apparatus for hierarchical cache line replacement
CN101576856A (en) * 2009-06-18 2009-11-11 浪潮电子信息产业股份有限公司 Buffer data replacement method based on access frequency within long and short cycle
US20150286580A1 (en) * 2011-11-01 2015-10-08 International Business Machines Corporation Management of partial data segments in dual cache systems
WO2013089786A1 (en) * 2011-12-16 2013-06-20 Soft Machine, Inc. Cache replacement policy
CN102663115A (en) * 2012-04-16 2012-09-12 中国人民大学 Main memory database access optimization method on basis of page coloring technology
US20160239433A1 (en) * 2012-11-12 2016-08-18 Facebook, Inc. Predictive cache replacement
WO2014084918A1 (en) * 2012-11-27 2014-06-05 Intel Corporation Providing extended cache replacement state information
CN103106153A (en) * 2013-02-20 2013-05-15 哈尔滨工业大学 Web cache replacement method based on access density
WO2014143053A1 (en) * 2013-03-15 2014-09-18 Intel Corporation Dead block predictors for cooperative execution in the last level cache
CN104111900A (en) * 2013-04-22 2014-10-22 中国移动通信集团公司 Method and device for replacing data in cache
CN103246616A (en) * 2013-05-24 2013-08-14 浪潮电子信息产业股份有限公司 Global shared cache replacement method for realizing long-short cycle access frequency
CN104714753A (en) * 2013-12-12 2015-06-17 中兴通讯股份有限公司 Data access and storage method and device
CN105302741A (en) * 2014-07-04 2016-02-03 华为技术有限公司 Cache control method and apparatus
US20160062916A1 (en) * 2014-08-27 2016-03-03 The Board Trustees Of The Leland Stanford Junior University Circuit-based apparatuses and methods with probabilistic cache eviction or replacement
CN104834607A (en) * 2015-05-19 2015-08-12 华中科技大学 Method for improving distributed cache hit rate and reducing solid state disk wear
CN104834609A (en) * 2015-05-31 2015-08-12 上海交通大学 Multi-level cache method based on historical upgrading and downgrading frequency
CN105302493A (en) * 2015-11-19 2016-02-03 浪潮(北京)电子信息产业有限公司 Swap-in and swap-out control method and system for SSD cache in mixed storage array
US20170168957A1 (en) * 2015-12-10 2017-06-15 Ati Technologies Ulc Aware Cache Replacement Policy
CN106569959A (en) * 2016-10-28 2017-04-19 郑州云海信息技术有限公司 Cache replacing method and system based on SSD
CN106527988A (en) * 2016-11-04 2017-03-22 郑州云海信息技术有限公司 SSD (Solid State Drive) data migration method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHOU Y等: "The multi-queue replacement algorithm for second level buffer caches", 《PROCEEDINGS OF THE 2001 USENIX ANNUAL TECHNICAL CONFERENCE》 *

Similar Documents

Publication Publication Date Title
US9053013B2 (en) Data storage device and operating method thereof
Dayan et al. Monkey: Optimal navigable key-value store
US8990477B2 (en) System and method for limiting fragmentation
US20140289479A1 (en) Bounding box prefetcher
US7624232B2 (en) Volume management method and apparatus
US8443163B1 (en) Methods, systems, and computer readable medium for tier-based data storage resource allocation and data relocation in a data storage array
US6877067B2 (en) Shared cache memory replacement control method and apparatus
US9223711B2 (en) Combining associativity and cuckoo hashing
JP3933027B2 (en) Cache memory partition management method in disk array system
US4468728A (en) Data structure and search method for a data base management system
JP3697162B2 (en) Method and configuration for delayed hashing for collaborative web caching
Sugumar et al. Efficient simulation of caches under optimal replacement with applications to miss characterization
JP3795985B2 (en) Computer memory system contention cache
KR20140063429A (en) Method of and apparatus for processing graphics
JP4087097B2 (en) Data relocation method and data relocation method considering database management system information
JP6025149B2 (en) System and method for managing data
US9898206B2 (en) Memory access processing method, apparatus, and system
US20160094381A1 (en) Methods of structuring data, pre-compiled exception list engines, and network appliances
JP4218997B2 (en) Collision reorganization in a hash bucket of a hash table to improve system performance
JP2558033B2 (en) How to replace data in data cache memory
CN103714097B (en) A kind of method and apparatus for accessing database
US6738865B1 (en) Method, system, and program for demoting data from cache based on least recently accessed and least frequently accessed data
EP0650616B1 (en) System and method for dynamically controlling cache management
JP4348093B2 (en) Accessing memory in an interleaved manner using a map table
KR101502896B1 (en) Distributed memory cluster control apparatus and method using map reduce

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination