Adaptive Group Based Replace Policy for high peroformance caching

Cahe plays an important role in the process of designing a microprocessor. In this paper, we propose an Adapative Group Based Replace Policy for high performance cache design. The basic idea is to insert the new incoming block to one of a group of blocks in the set. Group is organized by the blocks that have close addresses. Using group mechanism, our policy prevents a block to be evicted by a cache miss which belongs to another group. Experiment results shows that for workloads with cache thrashing problems our policy can improve the cache performance by 4% on average over LRU, and some programs can have up to 30% of improvements.