Pseudo-LIFO: the foundation of a new family of replacement policies for last-level caches

Cache blocks often exhibit a small number of uses during their life time in the last-level cache. Past research has exploited this property in two different ways. First, replacement policies have been designed to evict dead blocks early and retain the potentially live blocks. Second, dynamic insertion policies attempt to victimize single-use blocks (dead on fill) as early as possible, thereby leaving most of the working set undisturbed in the cache. However, we observe that as the last-level cache grows in capacity and associativity, the traditional dead block prediction-based replacement policy loses effectiveness because often the LRU block itself is dead leading to an LRU replacement decision. The benefit of dynamic insertion policies is also small in a large class of applications that exhibit a significant number of cache blocks with small, yet more than one, uses. To address these drawbacks, we introduce pseudo-last-infirst-out (pseudo-LIFO), a fundamentally new family of r...

• Type: Conference
• Year: 2009
• Where: MICRO
• Authors: Mainak Chaudhuri
• Keywords: Cache Blocks, Dead Block, Hardware, Last-level Cache, MICRO 2009