Talus: A simple way to remove cliffs in cache performance
Name
Sanchez_Talus.pdf
Size
653.29 KB
Format
Adobe PDF
Checksum (MD5)
8c7477eaaf27c4c2c8786cc964b0c5c5
Author(s)
Sanchez, Daniel
Beckmann, Nathan Zachary
Date Issued
February 2015
Journal
Proceedings of the 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Beckmann, Nathan, and Daniel Sanchez. “Talus: A Simple Way to Remove Cliffs in Cache Performance.” 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA) (February 2015).
Version
Author's final manuscript
Abstract
Caches often suffer from performance cliffs: minor changes in program behavior or available cache space cause large changes in miss rate. Cliffs hurt performance and complicate cache management. We present Talus, a simple scheme that removes these cliffs. Talus works by dividing a single application's access stream into two partitions, unlike prior work that partitions among competing applications. By controlling the sizes of these partitions, Talus ensures that as an application is given more cache space, its miss rate decreases in a convex fashion. We prove that Talus removes performance cliffs, and evaluate it through extensive simulation. Talus adds negligible overheads, improves single-application performance, simplifies partitioning algorithms, and makes cache partitioning more effective and fair.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/HPCA.2015.7056022
