Date Added: Nov 2013
The basic idea of the SLRU replacement policy is that if a line has been accessed while occupying the cache, it should be more difficult to evict than a line that has never been accessed. This paper is to design a low cost cache replacement algorithm that achieves comparable performance to existing scheme. In this paper, the authors proposed an enhancement to the SLRU (Segmented LRU) algorithm called fixed SLRU that fixes the number of protected and probationary segments. Due to an ineffective simulation environment, they were unable to fully understand their results.