Proposed enhancements to fixed segmented LRU cache replacement policy

The goal of this research is to design a low cost cache replacement algorithm that achieves comparable performance to existing scheme. In previous work, we 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, we were unable to fully understand our results. In this work, we will test fixed SLRU with an improved simulation environment, and propose three enhancements to the algorithm: cache bypassing, random promotion, and aging. Our experiment results show that fixed SLRU achieved an average speed up of 7.00% over LRU, and 4.22% over SLRU, with a maximum speed up of 43.55% over LRU, and 41.59% over standard SLRU. With certain enhancements applied, we achieved a maximum speed up of 61.70% over LRU.