Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Modeling cache performance beyond LRU

Modeling cache performance beyond LRU

Thumbnail Image
Download
Name

Sanchez_Modeling cache.pdf

Size

508.11 KB

Format

Adobe PDF

Checksum (MD5)

1eff499a6fce439dd32298331343b88b

Author(s)
Beckmann, Nathan Zachary
•
Sanchez, Daniel
Date Issued
April 2016
Journal
2016 IEEE International Symposium on High Performance Computer Architecture (HPCA)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Beckmann, Nathan, and Daniel Sanchez. "Modeling Cache Performance beyond LRU." 2016 IEEE International Symposium on High Performance Computer Architecture (HPCA), 12-16 March, 2106, Barcelona, Spain, IEEE, 2016, pp. 225–36.
Version
Author's final manuscript
Abstract
Modern processors use high-performance cache replacement policies that outperform traditional alternatives like least-recently used (LRU). Unfortunately, current cache models do not capture these high-performance policies as most use stack distances, which are inherently tied to LRU or its variants. 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. It uses absolute reuse distances instead of stack distances, and models replacement policies as abstract ranking functions. These innovations let us model arbitrary age-based replacement policies. Our model achieves median error of less than 1% across several high-performance policies on both synthetic and SPEC CPU2006 benchmarks. Finally, we present a case study showing how to use the model to improve shared cache performance.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/113093
DOI of Published Version
https://doi.org/10.1109/HPCA.2016.7446067
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.