Efficient analogy method for replacing cache randomly

A technology of random replacement and simulation method, applied in the computer field, can solve the problem of not being able to give the hit probability of the memory access sequence

Active Publication Date: 2010-12-15
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] An object of the present invention is to provide a high-efficiency simulation method for randomly replacing the cache, which is used to solve the problem that the traditional Monte Carlo simulation method cannot provide the hit probability of each point in the memory access sequence in one operation

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Efficient analogy method for replacing cache randomly
  • Efficient analogy method for replacing cache randomly
  • Efficient analogy method for replacing cache randomly

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0072] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments, but not as a limitation of the present invention.

[0073] Such as figure 1 As shown, it is a flow chart of the high-efficiency simulation method for random replacement cache of the present invention. The method flow includes:

[0074] Step 101, by pairing E(X i )=1-E((1-1 / M) Zi ) approximation, the estimation formula (1) is obtained:

[0075] E(X i )≈1-(1-1 / M) E(Zi) (1)

[0076] Using this estimate, it can be compared with E(Z i ) is defined to form an iterative formula;

[0077] This step is iterative so that E(X i ), and then calculate the hit probability of each point in the access sequence;

[0078] Step 102, through E(X i )=1-E((1-1 / M) Zi ) approximation, the estimation formula (2) is obtained:

[0079] E(X i )≈1-∏ j (1+E(X j ) / (M-1)) -1 (2)

[0080] Using this estimate, iterative formula itself is fo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to an efficient analogy method for replacing a cache randomly, comprising the following steps of: firstly, obtaining an estimating formula (1) or (2): E(Xi)is approximate to 1-(1-1/M)E(Zi)(1)E(Xi) is approximate to 1-Pij(1+E(Xj)/(M-1))-1(2) by approximating E(Xi)=1-E((1-1/MZi); and secondly, calculating the hit probability 1-E(Xi) of each point in a memory array according to E(Xi) obtained by the estimating formula (1) or (2), wherein Xi is an index random variable of a depletion event, E(Xi) is a mathematic expectation, M is the degree of association of the cache, Xj belongs to a reusing window of Xi, namely all depletion events during the period from value of ai appearing previously to i. If the value of the point ai in the memory array does not appear before, Zi is infinite; if the value of the point ai appears before, Zi is equal to time of depletion events during the period from value of ai appearing previously to i. The invention can obtain an estimation of the hit probability of each point in the memory array through one analogue round by using the estimating formula of a probability model.

Description

technical field [0001] The invention relates to cache simulation technology in the computer field, in particular to an efficient cache simulation method using a random replacement strategy. Background technique [0002] Caches are widely used in computer systems to improve performance. A cache maps addresses to values. Since the cost of accessing the cache is less than that of accessing the memory, putting the recently frequently accessed values ​​in the cache is beneficial to reduce the cost of accessing the memory. When a cache receives a request for an address, it searches its contents for the cache line corresponding to that address. If such a row exists, it is said that a hit event has occurred: the event returns the corresponding value stored in the cache; if such a row does not exist, it is said that a missing event has occurred: the event is obtained through some backup mechanism. Then, according to the replacement strategy, select a line from the candidate cache ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F12/08G06F12/126
Inventor 周舒畅
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap