CN106557435A - A kind of cache mode knows method for distinguishing, cache module and storage system - Google Patents
A kind of cache mode knows method for distinguishing, cache module and storage system Download PDFInfo
- Publication number
- CN106557435A CN106557435A CN201611034361.3A CN201611034361A CN106557435A CN 106557435 A CN106557435 A CN 106557435A CN 201611034361 A CN201611034361 A CN 201611034361A CN 106557435 A CN106557435 A CN 106557435A
- Authority
- CN
- China
- Prior art keywords
- history
- current
- access
- storage
- positional information
- 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
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/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0877—Cache access modes
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)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of cache mode knows method for distinguishing, including：The access positional information of the current IO that acquisition is received；Access position member in the information data of history IO of traversal storage, it is determined that meeting history IO of serial relation with the access positional information of the current IO；History IO is updated using the current IO, and access position member is updated to the access positional information of current IO；The method can reduce the consumption of Installed System Memory in effective identification business by succinct Data Structure Design while sequential access；The invention also discloses a kind of cache mould soon and storage system, with above-mentioned beneficial effect.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of cache mode is known method for distinguishing, cache module and is deposited
Storage system.
Background technology
Within the storage system, cache module is needed by pattern recognition to preferably carry out pre-reading, selecting cache algorithm
Algorithm recognizes the I/O mode of business, but at present, cache module consumes larger and pattern to the memory source of whole storage system to be known
Other algorithm itself can typically take more memory source, so as to increase demand of the whole cache subsystem to memory source.Cause
How this, reduce the consumption of Installed System Memory in effective identification business, be those skilled in the art's needs while sequential access
The technical problem of solution.
The content of the invention
It is an object of the invention to provide a kind of cache mode knows method for distinguishing, cache module and storage system, by succinct
Data Structure Design, can in effective identification business while sequential access reduce Installed System Memory consumption.
To solve above-mentioned technical problem, the present invention provides a kind of cache mode and knows method for distinguishing, including：
The access positional information of the current IO that acquisition is received；
Access position member in the information data of history IO of traversal storage, it is determined that the access position with the current IO
Information meets history IO of serial relation；
History IO is updated using the current IO, and access position member is updated to the access position letter of current IO
Breath.
Optionally, the access positional information in the information data of history IO of traversal storage, it is determined that with the current IO's
History IO that positional information meets serial relation is accessed, including：
Access position member in the information data of history IO of traversal storage, it is determined that the access position with the current IO
Continuous history IO of information；
History IO and the current IO's are judged using the time interval member in the information data of history IO
Time interval whether over-time threshold value；
If, it is determined that history IO is unsatisfactory for serial relation with the current IO；
If not, it is determined that history IO meets serial relation with the current IO.
Optionally, when also continuation degree member is included in described information data, the history is updated using the current IO
IO, and will access after position member is updated to the access positional information of current IO, also include：
The numerical value of the continuation degree member is added 1, and whether the numerical value of the continuation degree member after judging Jia 1 reaches company
Continuous degree threshold value；
If so, the whole IO being currently received then be the IO for meeting serial relation, and by the residue being currently received
IO updates history IO successively according to position relationship is accessed.
Optionally, when also including accessing frequent degree member in described information data, also include：
When history IO being updated using the current IO, will access frequent degree member's numerical value and add 1.
Optionally, also include：
When do not exist with the current IO access positional information meet history IO of serial relation when, traversal storage go through
Access frequent degree member in the information data of history IO, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and by institute
State current IO and replace minimum history IO of the numerical value for accessing frequent degree member.
Optionally, also include：
When do not exist with the current IO access positional information meet history IO of serial relation when, traversal storage access
The LUR chained lists of frequent degree member, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and the current IO is replaced into institute
State history IO of the numerical value minimum for accessing frequent degree member.
Optionally, the storage mode of history IO includes：Using history IO described in continuous storage of array or utilize hash
History IO described in storage of linked list.
The present invention also provides a kind of cache module, including：
Acquisition module, for obtaining the access positional information of the current IO for receiving；
Spider module, for the access position member in the information data of history IO of traversal storage, it is determined that working as with described
Front IO's accesses history IO that positional information meets serial relation；
Update module, for updating history IO using the current IO, and is updated to position member is accessed currently
The access positional information of IO；
Memory module, for storing history IO and corresponding information data.
Optionally, the memory module includes：
First memory element, for utilizing history IO described in continuous storage of array；Or,
Second memory element, for using history IO described in hash storage of linked list.
The present invention also provides a kind of storage system, including：According to cache module described above.
A kind of cache mode provided by the present invention knows method for distinguishing, including：The access position of the current IO that acquisition is received
Confidence ceases；Access position member in the information data of history IO of traversal storage, it is determined that the access position with the current IO
Information meets history IO of serial relation；History IO is updated using the current IO, and be updated to position member is accessed
The access positional information of current IO；
It can be seen that, the method accesses position member by arranging in IO, can be with according to the position in the access position member
Judge that the position of current IO is whether continuous with corresponding history IO, according to accessing the visit that position member both can be in identification business
Ask order；I.e. by succinct Data Structure Design, can be while sequential access in effective identification business in reduction system
The consumption deposited；Present invention also offers a kind of cache mould soon and storage system, with above-mentioned beneficial effect, will not be described here.
Description of the drawings
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
Accompanying drawing to be used needed for having technology description is briefly described, it should be apparent that, drawings in the following description are only this
Inventive embodiment, for those of ordinary skill in the art, on the premise of not paying creative work, can be with basis
The accompanying drawing of offer obtains other accompanying drawings.
The flow chart that Fig. 1 knows method for distinguishing by the cache mode that the embodiment of the present invention is provided；
The Hash table storage schematic diagram of history IO that Fig. 2 is provided by the embodiment of the present invention；
The storage of array schematic diagram of history IO that Fig. 3 is provided by the embodiment of the present invention；
The LRU storage of linked list schematic diagrams of history IO that Fig. 4 is provided by the embodiment of the present invention；
The structured flowchart of the cache module that Fig. 5 is provided by the embodiment of the present invention.
Specific embodiment
The core of the present invention is to provide a kind of cache mode and knows method for distinguishing, cache module and storage system, by succinct
Data Structure Design, can in effective identification business while sequential access reduce Installed System Memory consumption.
To make purpose, technical scheme and the advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
The a part of embodiment of the present invention, rather than the embodiment of whole.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Refer to Fig. 1, the flow chart that Fig. 1 knows method for distinguishing by the cache mode that the embodiment of the present invention is provided；The method
Can include：
The access positional information of the current IO that S100, acquisition are received；
Access position member in S110, the information data of history IO of traversal storage, it is determined that the visit with the current IO
Ask that positional information meets history IO of serial relation；
S120, history IO is updated using the current IO, and position member will be accessed be updated to the access of current IO
Positional information.
Specifically, information data is preserved in IO here, for preserving some about IO information for suitable in identification business
Sequence IO, carries out pre-reading with this, the operation such as caching replacement algorithms selection, for example, can preserve access position member such as each IO and visit
Last sector location information asked；When system receives IO, can be by the access positional information of the current IO for receiving
With storage history IO information data in access position member be compared, it may be determined that the start position information of front IO with
Whether the positional information that access position member represents is continuous.When exist storage history IO access position member with it is current
Continuous history IO of access positional information of IO, then assert that current IO is order IO with history IO；Current IO is have identified
With the ordering relation of history IO.Current IO is replaced into history IO, and correspondence modification accesses position member, will current IO
Access the access position member that position member replaces history IO.
The concrete IO positions that i.e. the present embodiment is not represented to accessing position member are defined, as long as which can be according to visit
Ask whether position is continuous for two IO of position member judgement.For example, specifically, access position member to be represented with last member,
Last sector of last member i.e. in IO information for the I O access, current IO can judge current IO by last member
It is whether continuous with the history I O access position.
Herein for the accurately fixed of history IO for improving identification, therefore a number of history IO to be safeguarded, and store
History IO can be nearest history IO.Certainly history IO for storing in the present embodiment is more, and recognition sequence IO successfully may
Property is higher.Requirement of the corresponding maintenance process to system also can accordingly increase will wait the hardware of system and can also improve.
Here user can carry out the storage of history IO according to self-demand.128 history IO can generally be safeguarded.
The judgement of history IO of storage subsequent order relation for convenience, that is, be easy to algorithm for pattern recognition i.e. ordering relation to know
The design of other method, it is possible to use succinct data structure.The identification of subsequent order relation was so both facilitated, had had to memory consumption
Amount is little；Therefore these history IO can be stored using simple and effective way.Preferably, the storage mode of history IO can be wrapped
Include：Using continuous storage of array history IO or using hash storage of linked list history IO.Specifically, deposited using one section of continuous internal memory
History IO (can for example be 128 history IO) for needing to safeguard is put, these history IO are preserved by the form of array；Can be by
First starting position of the original position or array of the internal memory is used as access (namely original position of traversal).It can also be group
The form of hash chained lists is made into, as shown in Figure 2.Access original position with the hash key in hash chained lists as IO, by fixed
Corresponding hash bucket are arrived in position, and from traversal history IO in the bucket, therefrom look for and meet going through for serial relation with current IO
History IO.For example when there is 128 history IO, the hash buckets number of hash tables is 128, so being not in generally
Hash conflicts, and time complexity is O (1), and the time complexity of the worst situation is O (n).
In the present embodiment the storage of the information data of IO can be the ad-hoc location that is added in I/O data, or
Add the data structure, or the array or hash chained lists in storage IO of the information data of a storage IO in each IO
In the data structure of an information data for storing position correspondence IO is set on each IO position.And can arrange in array
Preserve the data structure of information data and IO is stored in hash chained lists and the hash elements are also stored in array and arrange
Data structure in, such as shown in Fig. 3.
User can according to system computing capacity and for IO ordered modes identification precision requirement to information data
Modify.For example add corresponding judgement information in information data, to complete more accurately to sentence in ergodic process
It is fixed.Although for example can determine whether continuous two IO are actually continuous on position relationship by temporal information；Or it is logical
Cross with the IO consecutive hourss of the storage of uniform location, whether many current IO can be determined that the IO for this time receiving is continuously
IO etc..
Based on above-mentioned technical proposal, the cache mode that the embodiment of the present invention is carried knows method for distinguishing, is tied by succinct data
Structure is designed, and the history for having ordering relation with current IO can be just identified using the access positional information stored in data structure
IO, algorithm simple and fast；The consumption of Installed System Memory can be reduced in effective identification business while sequential access.
Based on above-described embodiment, in order to improve the judgement to IO serial relations, increase the accuracy of IO order identifications, traversal
Access positional information in the information data of history IO of storage, it is determined that meeting continuous with the access positional information of the current IO
History IO of relation can include：
Access position member in the information data of history IO of traversal storage, it is determined that the access position with the current IO
Continuous history IO of information；
History IO and the current IO's are judged using the time interval member in the information data of history IO
Time interval whether over-time threshold value；
If, it is determined that history IO is unsatisfactory for serial relation with the current IO；
If not, it is determined that history IO meets serial relation with the current IO.
Specifically, it is determined that after continuous history IO of access positional information with current IO, in the limit for increasing Time Continuous
Fixed condition；The time of history IO and the current IO is judged using the time interval member in the information data of history IO
Interval whether over-time threshold value, is unsatisfactory for serial relation with current IO if history IO more than if.Here the determination of time threshold
Can be set according to user, the concrete numerical value of time threshold is not defined here.5s can generally be selected.Example
Such as, specifically, time interval member is represented using member jiffies, for judging the time interval of current IO and history IO,
If current IO exceedes the 5s for setting with the time interval of history IO, even if both are continuous on read and write position, two are still judged
Person is not serial relation, as judges that serial relation increased an ineffectiveness restriction.To improve the standard of serial relation identification
The precision of really property, and then raising serial relation identification.
Based on above-mentioned technical proposal, the cache mode that the embodiment of the present invention is carried knows method for distinguishing, is tied by succinct data
Structure design, using the access positional information binding time interval information stored in data structure can just be recognized accurately with currently
IO has history IO of serial relation, and algorithm simple and fast is accurate；I.e. can be in effective identification business while sequential access
Reduce the consumption of Installed System Memory.
Based on above-mentioned any embodiment, in order to, on the basis of the accuracy for not affecting serial relation identification, further carry
High recognition efficiency, can increase continuation degree member in information data.It is i.e. preferred, it is continuous when also including in described information data
During degree member, history IO is updated using the current IO, and access position member is updated to the access position of current IO
After information, can also include：
The numerical value of the continuation degree member is added 1, and whether the numerical value of the continuation degree member after judging Jia 1 reaches company
Continuous degree threshold value；
If so, the whole IO being currently received then be the IO for meeting serial relation, and by the residue being currently received
IO updates history IO successively according to position relationship is accessed.
Specifically, when once current IO and history IO with serial relation is successfully recognized every time, by continuation degree into
The numerical value of member adds 1, and whether the numerical value of the continuation degree member after judging Jia 1 reaches continuation degree threshold value, when reached, then it is assumed that when
Before this time IO for receiving be continuous IO.Its history IO with correspondence position can be set up into serial relation directly.If for example existing
5 serial relations are identified at corresponding history IO of same position continuously, then it is considered that the whole IO for this time receiving have
There is serial relation.The IO of the rearmost position of this IO for receiving corresponding access position member can be updated to the storage position
Put corresponding access position member.For example, specifically, using the length that sequential member is the IO connected references, that is, connect
Continuous degree, when continuation degree reaches the threshold value of setting, that is, regards as continuous IO.
Based on above-mentioned any embodiment, as history IO of system maintenance always has quantity to limit, it is impossible to unconfined dimension
Protect each new IO.So can all there is the phenomenon that can not represent whole IO.Imitate to improve using for history IO of maintenance
Rate.Statistics that can be during cache mode is recognized to the history IO degree of conducting interviews of each storage location；And then can be with
History IO being not frequently used is determined according to statistical result.It is i.e. preferred, when also including accessing frequency in described information data
During numerous degree member, can also include：
When history IO being updated using the current IO, will access frequent degree member's numerical value and add 1.
Specifically, for example access frequent degree member is represented using lru, its numerical value is meant that after history IO is stored first
The number of times that the IO of the storage location is accessed to.User can judge the activity of history IO of storage according to the numerical value.
Based on the access frequent degree obtained in above-mentioned technical proposal, the method can also include：
When do not exist with the current IO access positional information meet history IO of serial relation when, traversal storage go through
Access frequent degree member in the information data of history IO, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and by institute
State current IO and replace minimum history IO of the numerical value for accessing frequent degree member.
Specifically, when do not exist with the current IO access positional information meet history IO of serial relation when, that is, recognize
The fixed current IO is new IO.In order to ensure that the follow-up new IO can carry out further cache pattern recognition, need this is new
IO is stored.Access frequent degree member in the information data of history IO at this moment traveling through storage, it is determined that access frequent degree into
Minimum history IO of the numerical value of member, and current IO (new IO) is replaced history IO of the numerical value minimum for accessing frequent degree member.
Further, in order to prevent access, still frequently IO is deleted.Here obtaining accessing the numerical value of frequent degree member
After minimum history IO, whether the numerical value for needing the numerical value for judging access frequent degree member again minimum deletes threshold more than setting
Value, if being more than, prove the IO although compare other storages I O access angle value it is although little, but still access very frequently, only
It is that the relative frequent degree that accesses is less, at this moment can not be replaced, system can be in the way of increases memory space by new generation
IO is preserved.
The statistics of frequent degree further behind extension storage space, is accessed through a period of time, frequent degree can will be accessed
Deleted less than corresponding history IO of threshold value is deleted, it is also possible to carry out above-mentioned access frequent degree until producing new IO
Comparison procedure.
When frequent degree is accessed using this easy accurately form statistics storage of LUR chained lists, the method can also include：
When do not exist with the current IO access positional information meet history IO of serial relation when, traversal storage access
The LUR chained lists of frequent degree member, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and the current IO is replaced into institute
State history IO of the numerical value minimum for accessing frequent degree member.
Specifically, as shown in figure 4, the I/O request of all maintenances accesses frequent degree by LRU chained lists statistics, when there is new IO
Arrive, at the same ltsh chain table completely when, can by LRU chained lists will access least frequently history IO is eliminated, vacate sky
Between for depositing new I/O request.
Based on above-mentioned technical proposal, the cache mode that the embodiment of the present invention is carried knows method for distinguishing, compares traditional mode identification
Algorithm complex is higher, poor universality and EMS memory occupation amount is larger, and the algorithm and data structure that complexity has been abandoned in the method sets
By indirectly ltsh chain table and LRU chained lists, meter, effectively realizes that business model is recognized, and IO identification effectiveness is higher；Pattern
Recognizer complexity is relatively low, and versatility is good；Algorithm for pattern recognition data structure is succinct, less to memory consumption.
Below cache module provided in an embodiment of the present invention and storage system are introduced, cache module described below
And storage system can be mutually to should refer to above-described cache mode knowledge method for distinguishing.
Refer to Fig. 5, the structured flowchart of the cache module that Fig. 5 is provided by the embodiment of the present invention；The cache module can be with
Including：
Acquisition module 100, for obtaining the access positional information of the current IO for receiving；
Spider module 200, for travel through storage history IO information data in access position member, it is determined that with it is described
Current IO's accesses history IO that positional information meets serial relation；
Update module 300, for updating history IO using the current IO, and access position member is updated to work as
The access positional information of front IO；
Memory module 400, for storing history IO and corresponding information data.
Based on above-described embodiment, spider module 200 can include：
Sequential cells, for the access position member in the information data of history IO of traversal storage, it is determined that working as with described
Continuous history IO of access positional information of front IO；
Overtime identifying unit, for judging the history using the time interval member in the information data of history IO
The time interval of the IO and current IO whether over-time threshold value；If, it is determined that history IO is with the current IO not
Meet serial relation；If not, it is determined that history IO meets serial relation with the current IO.
Based on above-mentioned any embodiment, when also continuation degree member is included in described information data, the cache module may be used also
To include：
Continuation degree module, for adding 1 by the numerical value of the continuation degree member, and judges the continuation degree member after Jia 1
Numerical value whether reach continuation degree threshold value；If so, the whole IO being currently received then are the IO for meeting serial relation, and will
The remaining IO being currently received updates history IO successively according to position relationship is accessed.
Based on above-mentioned any embodiment, when also including accessing frequent degree member in described information data, the cache module
Can also include：
Frequent degree module is accessed, for when history IO being updated using the current IO, accessing frequent degree member
Numerical value adds 1.
Based on above-described embodiment, the cache module can also include：
Replacement module, the positional information that accesses for not existing with the current IO meet history IO of serial relation
When, the access frequent degree member in the information data of history IO for traveling through storage, it is determined that the numerical value for accessing frequent degree member is minimum
History IO, and the current IO is replaced into minimum history IO of the numerical value for accessing frequent degree member.
Based on above-described embodiment, replacement module is met specifically for the access positional information that ought not exist with the current IO
During history IO of serial relation, traversal storage accesses the LUR chained lists of frequent degree member, it is determined that accessing the numerical value of frequent degree member most
Little history IO, and the current IO is replaced into minimum history IO of the numerical value for accessing frequent degree member.
Optionally, the memory module 400 includes：
First memory element, for utilizing history IO described in continuous storage of array；Or,
Second memory element, for using history IO described in hash storage of linked list.
The embodiment of the present invention also provides a kind of storage system, including：Cache module as described in above-mentioned embodiment.
Specifically, the cache module of storage system needs offer business model recognizer to carry out order IO in identification business,
Carry out pre-reading with this, the operation such as caching replacement algorithms selection, memory source consumption of the existing cache module to whole storage system
Larger, business model recognizer is typically also larger to the occupancy of internal memory, and this storage system is set by succinct data structure
Meter, can reduce the consumption of Installed System Memory in effective identification business while sequential access.
In description, each embodiment is described by the way of progressive, and what each embodiment was stressed is and other realities
Apply the difference of example, between each embodiment identical similar portion mutually referring to.For mould is cached disclosed in embodiment
For block and storage system, as which corresponds to the method disclosed in Example, so description is fairly simple, related part ginseng
See method part illustration.
Professional further appreciates that, with reference to the unit of each example of the embodiments described herein description
And algorithm steps, can with electronic hardware, computer software or the two be implemented in combination in, in order to clearly demonstrate hardware and
The interchangeability of software, generally describes the composition and step of each example in the above description according to function.These
Function actually with hardware or software mode performing, depending on the application-specific and design constraint of technical scheme.Specialty
Technical staff can use different methods to realize described function to each specific application, but this realization should not
Think beyond the scope of this invention.
The step of method described with reference to the embodiments described herein or algorithm, directly can be held with hardware, processor
Capable software module, or the combination of the two is implementing.Software module can be placed in random access memory (RAM), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, depositor, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Knowing method for distinguishing, cache module and storage system to cache mode provided by the present invention above has carried out detailed Jie
Continue.Specific case used herein is set forth to the principle and embodiment of the present invention, and the explanation of above example is only
It is to be used to help understand the method for the present invention and its core concept.It should be pointed out that for those skilled in the art
For, 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 improve and repair
Decorations are also fallen in the protection domain of the claims in the present invention.
Claims (10)
1. a kind of cache mode knows method for distinguishing, it is characterised in that include：
The access positional information of the current IO that acquisition is received；
Access position member in the information data of history IO of traversal storage, it is determined that the access positional information with the current IO
Meet history IO of serial relation；
History IO is updated using the current IO, and access position member is updated to the access positional information of current IO.
2. method according to claim 1, it is characterised in that the access position in the information data of history IO of traversal storage
Confidence ceases, it is determined that history IO of serial relation is met with the access positional information of the current IO, including：
Access position member in the information data of history IO of traversal storage, it is determined that the access positional information with the current IO
Continuous history IO；
The time of history IO and the current IO is judged using the time interval member in the information data of history IO
Interval whether over-time threshold value；
If, it is determined that history IO is unsatisfactory for serial relation with the current IO；
If not, it is determined that history IO meets serial relation with the current IO.
3. method according to claim 2, it is characterised in that when also continuation degree member is included in described information data,
History IO is updated using the current IO, and will access after position member is updated to the access positional information of current IO,
Also include：
The numerical value of the continuation degree member is added 1, and whether the numerical value of the continuation degree member after judging Jia 1 reaches continuation degree
Threshold value；
If so, the whole IO being currently received then be the IO for meeting serial relation, and by the remaining IO being currently received by
History IO is updated successively according to position relationship is accessed.
4. method according to claim 3, it is characterised in that when also including accessing frequent degree member in described information data
When, also include：
When history IO being updated using the current IO, will access frequent degree member's numerical value and add 1.
5. method according to claim 4, it is characterised in that also include：
When do not exist with the current IO access positional information meet history IO of serial relation when, travel through storage history IO
Information data in access frequent degree member, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and will it is described ought
Front IO replaces minimum history IO of the numerical value for accessing frequent degree member.
6. method according to claim 4, it is characterised in that also include：
When not existing with the current IO when accessing positional information and meeting history IO of serial relation, traversal storage accesses frequent
The LUR chained lists of degree member, it is determined that minimum history IO of the numerical value for accessing frequent degree member, and the current IO is replaced into the visit
Ask the numerical value of frequent degree member minimum history IO.
7. the method according to any one of claim 1-5, it is characterised in that the storage mode of history IO includes：Profit
With history IO described in continuous storage of array or using history IO described in hash storage of linked list.
8. a kind of cache module, it is characterised in that include：
Acquisition module, for obtaining the access positional information of the current IO for receiving；
Spider module, for travel through storage history IO information data in access position member, it is determined that with the current IO
The positional information that accesses meet history IO of serial relation；
Update module, for updating history IO using the current IO, and is updated to current IO's by position member is accessed
Access positional information；
Memory module, for storing history IO and corresponding information data.
9. cache module according to claim 8, it is characterised in that the memory module includes：
First memory element, for utilizing history IO described in continuous storage of array；Or,
Second memory element, for using history IO described in hash storage of linked list.
10. a kind of storage system, it is characterised in that include：Cache module according to claim 8 or claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034361.3A CN106557435B (en) | 2016-11-16 | 2016-11-16 | Cache mode identification method, cache module and storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034361.3A CN106557435B (en) | 2016-11-16 | 2016-11-16 | Cache mode identification method, cache module and storage system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106557435A true CN106557435A (en) | 2017-04-05 |
| CN106557435B CN106557435B (en) | 2020-03-06 |
Family
ID=58443453
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611034361.3A Active CN106557435B (en) | 2016-11-16 | 2016-11-16 | Cache mode identification method, cache module and storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106557435B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023931A (en) * | 2010-12-17 | 2011-04-20 | 曙光信息产业(北京)有限公司 | Self-adaption cache pre-fetching method |
| CN103927136A (en) * | 2014-04-21 | 2014-07-16 | 华为技术有限公司 | Identification method and device for input and output IO types |
| CN104134027A (en) * | 2014-07-23 | 2014-11-05 | 华为技术有限公司 | Sequence flow recognition method and sequence flow recognition device |
| CN104156321A (en) * | 2014-07-23 | 2014-11-19 | 华为技术有限公司 | Data pre-fetching method and device |
-
2016
- 2016-11-16 CN CN201611034361.3A patent/CN106557435B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023931A (en) * | 2010-12-17 | 2011-04-20 | 曙光信息产业(北京)有限公司 | Self-adaption cache pre-fetching method |
| CN103927136A (en) * | 2014-04-21 | 2014-07-16 | 华为技术有限公司 | Identification method and device for input and output IO types |
| CN104134027A (en) * | 2014-07-23 | 2014-11-05 | 华为技术有限公司 | Sequence flow recognition method and sequence flow recognition device |
| CN104156321A (en) * | 2014-07-23 | 2014-11-19 | 华为技术有限公司 | Data pre-fetching method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106557435B (en) | 2020-03-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106527988B (en) | A kind of method and device of solid state hard disk Data Migration | |
| CN103440207B (en) | Caching method and caching device | |
| CN104899156B (en) | A kind of diagram data storage and querying method towards extensive social networks | |
| CN104571954B (en) | A kind of date storage method and device | |
| US20150363457A1 (en) | Deduplicating storage with enhanced frequent-block detection | |
| CN106599199A (en) | Data caching and synchronization method | |
| US7818505B2 (en) | Method and apparatus for managing a cache memory in a mass-storage system | |
| Lv et al. | Operation-aware buffer management in flash-based systems | |
| CN107463509B (en) | Cache management method, cache controller and computer system | |
| CN104503703B (en) | The treating method and apparatus of caching | |
| CN104090852A (en) | Method and equipment for managing hybrid cache | |
| CN104572502B (en) | A kind of storage system cache policy adaptive approach | |
| JP6711121B2 (en) | Information processing apparatus, cache memory control method, and cache memory control program | |
| CN108139872A (en) | A kind of buffer memory management method, cache controller and computer system | |
| CN104156323B (en) | A kind of adaptive read method of the data block length of cache memory and device | |
| CN105404595B (en) | Buffer memory management method and device | |
| CN110147331A (en) | Caching data processing method, system and readable storage medium storing program for executing | |
| CN105389135A (en) | Solid-state disk internal cache management method | |
| CN107247675A (en) | A kind of caching system of selection and system based on classification prediction | |
| CN106294211B (en) | A kind of detection method and device of multichannel sequential flow | |
| US20210286730A1 (en) | Method, electronic device and computer program product for managing cache | |
| CN106062703B (en) | Storage system | |
| CN109144431B (en) | Data block caching method, device, equipment and storage medium | |
| US11693570B2 (en) | Machine learning to improve caching efficiency in a storage system | |
| CN102169464B (en) | Caching method and device used for non-volatile memory, and intelligent card |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200114 Address after: 215100 No. 1 Guanpu Road, Guoxiang Street, Wuzhong Economic Development Zone, Suzhou City, Jiangsu Province Applicant after: Suzhou Wave Intelligent Technology Co., Ltd. Address before: 450018 Henan province Zheng Dong New District of Zhengzhou City Xinyi Road No. 278 16 floor room 1601 Applicant before: Zhengzhou Yunhai Information Technology Co. Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |