Abstract

Cache is an important component in computer architecture. It has great effects on the performance of systems. Nowadays, Least Recently Used (LRU) Algorithm is one of the most commonly used one because it is easy to implement and with a relatively good performance. However, in some particular cases, LRU is not a good choice. To provide references for the computer architecture designer, the study proposed a new algorithm named Fully Replacement Policy (FRP) and then analyzed various factors of effects on cache performance, carried out the simulation experiment of cache performance based on SimpleScalar toolset and SPEC2000 benchmark suite. The study compared the effects of Fully Replacement Policy with Least Recently Used (LRU) Algorithm when set size, block size, associativity and replacement methods are changed separately., By experimentally analyzing the results, it was found that FRP outperforms LRU in some particular situations.

Highlights

  • IntroductionCache of CPU has two levels: L-1 cache and L-2 cache

  • This paper mainly describes the cache performance simulation in order to provide reference for architecture designing, especially for high performance architecture

  • For 32 bytes block size, the miss rate of Least Recently Used (LRU) is 2.63% while that of Fully Replacement Policy (FRP) is 2.66%, which is 0.03% higher

Read more

Summary

Introduction

Cache of CPU has two levels: L-1 cache and L-2 cache. Some high performance processors have L-3 cache. In light of recent changes in hardware landscape, we believe that in the future, multilevel caches are invariably going to be hybrid caches where 1) all/most levels are physically collocated 2) the levels differ substantially only with respect to performance and not storage density, and 3) all levels are persistent [1]. The more cache level or the more capacity, the better performance. It’s very necessary to grasp all kinds of effects on architecture. Software simulation should be a good choice because of the inevitable complexity of hardware implementation

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call