Adaptive insertion policies for high performance caching
Proceedings of the 34th annual international symposium on Computer architecture
Adaptive insertion policies for managing shared caches
Proceedings of the 17th international conference on Parallel architectures and compilation techniques
PIPP: promotion/insertion pseudo-partitioning of multi-core shared caches
Proceedings of the 36th annual international symposium on Computer architecture
Pseudo-LIFO: the foundation of a new family of replacement policies for last-level caches
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
High performance cache replacement using re-reference interval prediction (RRIP)
Proceedings of the 37th annual international symposium on Computer architecture
| Hi-index | 0.00 |
Dynamic cache resizing mechanisms have been proposed to achieve both high performance and low energy consumption. The basic idea behind such mechanisms is to divide a cache into some parts, and manage them independently to resize the cache for resource allocation and energy saving. However, dynamic cache resizing mechanisms waste their resource to store a lot of dead-on-fill blocks, which are not reused after being stored in the cache. To reduce the number of dead-on-fill blocks in the cache and thus improve energy efficiency of dynamic cache resizing mechanisms, this paper proposes a dynamic LRU-K insertion policy. The policy stores a new coming block as the K-th least-recently-used one and adjusts K dynamically according to the application to be executed. Therefore, the policy can balance between early eviction of dead-on-fill blocks and retainment of reusable blocks.