Author : Dhammpal Ramtake 1
Date of Publication :22nd February 2018
Abstract: Nowadays, processing speed is one of the most important performance criteria of modern multicore processors. For achieving higher processing speed of processor various components are used, in which cache is one of them. As modern processors include multiple levels of caches and as cache associativity increases, it is important to revisit the effectiveness of common cache replacement policies. In this paper, we have analysed the impact of different replacement policies such as LRU (Least Recently Used), FIFO (First In First Out), RANDOM, DIP (Dynamic Insertion Policy), PLRU-t (Pseudo Least Recently Used tree-based). We have used Simple Scalar as a simulation tool. We have taken the problem of matrix multiplication of different size 10 x 10, 100 x 100, 500 x 500.
Reference :