A cache memory replacement method and system based on usage heat

Abstract

The present disclosure discloses a cache memory replacement method and system based on usage heat, including: dividing the Cache into n Cache blocks, and forming a heat comparison group between the n Cache blocks and their corresponding heat values; Get the request, judge whether the CPU data to be read exists in the Cache, if it is hit, find the hit Cache block and its corresponding heat value, increase the heat value according to the preset heat enhancement factor, and the heat value of the rest of the missed Cache blocks according to The heat decay factor is used to attenuate, and the CPU data is read in the hit Cache block; if it is not hit, find the Cache block with the smallest heat value and less than or equal to the replacement threshold, replace the CPU data to be read into the Cache block, and the rest The heat value of the unreplaced cache block is attenuated according to the heat decay factor. Count the access frequency of the code in the Cache, and replace it after the access heat decreases; through the heat enhancement factor and heat decay factor parameters, it is suitable for different execution codes and maintains a high hit rate.

Description

technical field [0001] The present disclosure relates to the technical field of data storage and reading, and in particular to a cache replacement method and system based on usage heat. Background technique [0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art. [0003] Cache memory (Cache) is a storage system located between the CPU (Central Processing Unit) and DRAM (Dynamic Random Access Memory) or flash (flash memory). Generally, Cache has a smaller capacity and faster speed than DRAM or flash. The speed of the CPU is much higher than that of the memory. When the CPU directly accesses data from the memory, it has to wait for a certain period of time, while the Cache can save a part of the data that the CPU has just used or recycled. If the CPU needs to use this part of the data again, it can Call directly from the Cache, thus avoiding repeated access to data, reducing t...

AI Technical Summary

Problems solved by technology

However, an algorithm with a high cache hit rate is generally complex to implement and consumes a lot of resources; while an algorithm with a simple algorithm and a small resource occupation will have a low hit rate, or rely heavily on code execution rules, have low flexibility, and cannot be flexibly changed according to the code The question of replacement strategies

Images