Method for realizing instruction buffer lock

Abstract

The invention discloses a method for realizing instruction buffer lock, which comprises the following steps: 1) analyzing program summary, pre-running a section of program, and recording a memory block access sequence, citation times, re-access time interval and hit times; and 2) selecting memory blocks to be locked in a buffer, setting an access counter and a least recently used (LRU) counter for each memory block, accessing memory block access times recorded in the counters, assigning weights N1 and N2 to the access counter and LRU counter in each memory block, counting according to N1*access times+N2*(LRU counter limit-LRU value), and if the counted values are greater than a threshold M, locking the memory blocks in the buffer, wherein N1+N2=1. In the invention, the memory blocks locked in the instruction buffer can be replaced only when the lock is removed, the buffer hit rate is improved greatly, the accesses to low-level storage are reduced, and average memory access delay is reduced.

Description

technical field [0001] The invention relates to the storage field in the architecture, in particular to a method for realizing an instruction cache lock. Background technique [0002] At present, the performance of most embedded systems is determined by the average memory access delay to a large extent. Improving the cache hit rate can reduce the number of memory accesses and improve system performance. Some current embedded processors use a cache lock mechanism to lock some memory blocks in the cache under software control. The role of the cache is mainly to alleviate the speed and performance mismatch between the adjustment processor and the low-speed main memory. In the actual process, the instruction cache plays a vital role in the performance and energy consumption of the embedded system, because the instruction is is fetched every clock cycle. The improvement of instruction cache performance has a great impact on the overall system performance, and many technologies ...

AI Technical Summary

Problems solved by technology

There are also some cache lock methods that have a loop structure, and each loop needs to be evaluated and predicted. The performance loss is large, and the same method is used to evaluate the price / performance ratio, which leads to inaccuracy.

The predecessors also proposed a data cache lock mechanism based on the reference length window for each data access instruction. The data cache lock has not evaluated the cost-effectiveness and cannot guarantee performance improvement.

Images