会议专题

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. Ising 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.

cache replace policy group microprocessor

Liqiang He Yan Sun Chaozhong Zhang

College of Computer Science Inner Mongolia University Huhhot, Inner Mongolia 010021 P.R.China

国际会议

2010 3rd IEEE International Conference on Computer Science and Information Technology(第三届IEEE计算机科学与信息技术国际会议 ICCSIT 2010)

成都

英文

729-732

2010-07-07(万方平台首次上网日期,不代表论文的发表时间)