KORA-2: a new cache replacement policy and its performance

In this paper, we propose a new strategy (KORA-2) for the replacement of lines in cache memories. The algorithm is efficient and easily implementable. Trace-driven simulations were performed for 42 different cache configurations using benchmark programs from SPEC92 (Standard performance Evaluation Corporation) benchmark suites. Simulation results illustrate that our algorithm can provide a peak value of approximately 8.71% improvement in the miss ratio over the best performing conventional algorithm (LRU) for the selected benchmark trace files generated from SPEC programs. This translates to a savings of hundreds of thousands of misses for typical programs referencing well over 100 million addresses.

[1]  Mohammad S. Obaidat,et al.  Estimating neural networks-based algorithm for adaptive cache replacement , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Eric E. Johnson,et al.  PDATS Lossless Address Trace Compression For Reducing File Size And Access Time , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[3]  Mohammad S. Obaidat,et al.  Performance evaluation of a new cache replacement scheme using SPEC , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[4]  Thomas M. Conte,et al.  The Effect of Code Expanding Optimizations on Instruction Cache Design , 1993, IEEE Trans. Computers.

[5]  Mahmoud A. Manzoul,et al.  AN IMPROVED FUZZY REPLACEMENT ALGORITHM FOR CACHE MEMORIES , 1993 .

[6]  Mohammad S. Obaidat,et al.  Simulation Study of a Novel Cache Replacement Algorithm , 1997, Simul..