Adaptive weight-based: an exclusive bypass algorithm for L3 cache in a three level cache hierarchy

摘要

Cache memory plays a decisive role in recent day processors. Current processors use multi-level cache hierarchy to avoid the capacity misses. Still processors have to pay high cost due to conflict misses. To avoid such misses, several replacement techniques are used in the cache memory. Whereas, in a multi-level cache, where enormous applications are running simultaneously, a bypass replacement technique in the last level cache is found significant from the reduced miss cost, CPU performance point of view. This paper presents a similar solution of bypassing in the L3 cache, called adaptive weight-based (AWB) bypass algorithm which shows better performance assessment compared to LRU with different benchmark traces from SPEC.