Method for realizing replacement policies of shared second-level cache under multi-core architecture

Abstract

The invention relates to the field of hierarchical structure design of storages and aims to provide a method for realizing replacement policies of a shared second-level cache under a multi-core architecture. The method comprises the following steps: dividing a cache group, carrying out a close replacement policy, and carrying out different replacement policies on different programs according to different access modes of programs on cores under the multi-core architecture. The invention has the advantages that in a multi-core environment, aiming at the problems existing in the least recently used replacement policy, cache blocks in the cache group are grouped, and different replacement policies are respectively used for the groups, thereby reducing the cache deletion, greatly reducing the storage cost and the complexity of circuits and enhancing the performance of the system. In a multi-core environment, different replacement policies are more adapted to different programs or threads, and therefore, the invention proposes that different cache replacement policies are performed in different divided groups.

Description

technical field [0001] The invention relates to the field of memory hierarchy design, in particular to a method for realizing a replacement strategy of a shared secondary Cache under a multi-core architecture. Background technique [0002] For a shared L2 cache, the cost of a cache miss is considerable: it takes hundreds of cycles to access main memory. Usually, the Cache replacement strategy adopted is the least recently used replacement strategy, but there are many shortcomings in the least recently used replacement strategy: First, the least recently used replacement strategy only considers the latest information accessed by the Cache, but does not consider the information accessed by the Cache. Frequency information; secondly, when the Cache capacity is smaller than the working set of the program, the Cache will show jitter phenomenon, conflicts and misses will occur, which will cause the performance of the computer to degrade; moreover, the hardware implementation of th...

AI Technical Summary

Problems solved by technology

Usually, the Cache replacement strategy adopted is the least recently used replacement strategy, but there are many shortcomings in the least recently used replacement strategy: First, the least recently used replacement strategy only considers the latest information accessed by the Cache, but does not consider the information accessed by the Cache. Frequency information; secondly, when the Cache capacity is smaller than the working set of the program, the Cache will show jitter, conflicts and misses will occur, which will cause the performance of the computer to degrade; moreover, the hardware implementation of the least recently used replacement strategy is quite expensive

In order to overcome the shortcomings of the least recently used replacemen...

Images