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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com