Page placement algorithms for large real-indexed caches
ACM Transactions on Computer Systems (TOCS)
Avoiding conflict misses dynamically in large direct-mapped caches
ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
An empirical study of the effects of careful page placement in Linux
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Reducing cache misses using hardware and software page placement
ICS '99 Proceedings of the 13th international conference on Supercomputing
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
| Hi-index | 0.00 |
Reducing cache conflict misses by improving the placement of page frames in the cache has been shown to increase overall system performance. Research efforts have focused on improving the distribution of page frames across cache bins with the goal of obtaining an even distribution of physical page frames in each bin. The problem with attempting to increase performance through even distribution of pages into cache bins is that these approaches do not consider accesses to the pages in the bins. In this paper, we propose an approach that considers page activity together with page placement in tuning system performance. We design and implement a data collection tool to allow us to analyze page activity in cache bins. Our analysis indicates that page placement techniques that provide for an even distribution of pages to bins can result in a disproportionate number of long lived, active pages being mapped to the same bin. We refer to these active bins as hot bins. We then design and implement a technique using standard paging hardware and software techniques to reduce activity in hot bins by remapping long lived active pages to bins with less active pages. Our experiments indicate that the remapping of active, long lived pages can increase system performance.