A case for two-way skewed-associative caches
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
A data cache with multiple caching strategies tuned to different types of locality
ICS '95 Proceedings of the 9th international conference on Supercomputing
Utilizing reuse information in data cache management
ICS '98 Proceedings of the 12th international conference on Supercomputing
A locality sensitive multi-module cache with explicit management
ICS '99 Proceedings of the 13th international conference on Supercomputing
ACM Computing Surveys (CSUR)
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Improving cache performance via active management
Improving cache performance via active management
| Hi-index | 0.02 |
Caches do not grow in size at the speed of main memory or raw processor performance. Therefore, optimal use of the limited cache resources is of paramount importance to obtain a good system performance. Instead of a recency-based replacement policy (such as, e.g., LRU), we can also make use of a locality-based policy, based on the temporal reuse of data. These replacement policies have usually been constructed to operate in a cache with multiple modules, some of them dedicated to data showing high temporal reuse, and some of them dedicated to data showing low temporal reuse. In this paper, we show how locality-based replacement policies can be adapted to operate in set-associative and skewed-associative [8] caches. In order to understand the benefits of locality-based replacement policies, they are compared to recency-based replacement policies, something that has not been done before.