Most recent cache designs use Least Recently Used (LRU) replacement strategy to provide the high performance required by modern fast CPUs. We propose a new replacement technique that uses some heuristic to detect loop structures in the reference patterns. Initially, the proposed technique uses the LRU strategy. Once a loop has been detected, all the references, which would result in poor performance if they were to be cached, will be dynamically excluded from being stored in the cache. The LRU strategy will resume as soon as the end of the loop has been detected. We have also developed a simulation program to compare the performance of this scheme to that of other related ones, so as to demonstrate its effectiveness. The results show our scheme outperforms the others when the system references are loop dominated.
|Number of pages||6|
|State||Published - 1995|
|Event||Proceedings of the 1995 Southcon Conference - Lauderdale, FL, USA|
Duration: Mar 7 1995 → Mar 7 1995
|Conference||Proceedings of the 1995 Southcon Conference|
|City||Lauderdale, FL, USA|
|Period||03/7/95 → 03/7/95|