Dueling CLOCK: Adaptive Cache Replacement Policy Based on The CLOCK Algorithm

Provided by: edaa
Topic: Hardware
Format: PDF
The authors consider the problem of on-chip L2 cache management and replacement policies. They propose a new adaptive cache replacement policy, called Dueling Clock (DC) that has several advantages over the Least Recently Used (LRU) cache replacement policy. LRU's strength is that it keeps track of the 'Recency' information of memory accesses. However, LRU has a high overhead cost of moving cache blocks into the most recently used position each time a cache block is accessed; LRU does not exploit 'Frequency' information of memory accesses and LRU is prone to cache pollution when a sequence of single-use memory accesses that are larger than the cache size is fetched from memory.

Find By Topic