A Cache Model for Modern Processors
Author(s)
Beckmann, Nathan; Sanchez, Daniel
DownloadMIT-CSAIL-TR-2015-011.pdf (757.1Kb)
Other Contributors
Computation Structures
Advisor
Daniel Sanchez
Terms of use
Metadata
Show full item recordAbstract
Modern processors use high-performance cache replacement policies that outperform traditional alternatives like least-recently used (LRU). Unfortunately, current cache models use stack distances to predict LRU or its variants, and cannot capture these high-performance policies. Accurate predictions of cache performance enable many optimizations in multicore systems. For example, cache partitioning uses these predictions to divide capacity among applications in order to maximize performance, guarantee quality of service, or achieve other system objectives. Without an accurate model for high-performance replacement policies, these optimizations are unavailable to modern processors. We present a new probabilistic cache model designed for high-performance replacement policies. This model uses absolute reuse distances instead of stack distances, which makes it applicable to arbitrary age-based replacement policies. We thoroughly validate our model on several high-performance policies on synthetic and real benchmarks, where its median error is less than 1%. Finally, we present two case studies showing how to use the model to improve shared and single-stream cache performance.
Date issued
2015-04-09Series/Report no.
MIT-CSAIL-TR-2015-011
Collections
The following license files are associated with this item: