Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. CSAIL Digital Archive
  4. CSAIL Technical Reports (July 1, 2003 - present)
  5. Bridging Theory and Practice in Cache Replacement

Bridging Theory and Practice in Cache Replacement

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2015-034.pdf

Size

883.45 KB

Format

Adobe PDF

Checksum (MD5)

1804f386da9b73c775fc1899a257b433

Download all files submitted through automated deposit
beckmann@CSAIL.MIT.EDU-5675afff.29807.zip (618.46 KB)
Author(s)
Beckmann, Nathan
•
Sanchez, Daniel
Advisor(s)
Daniel Sanchez
Date Issued
December 19, 2015
Series/Report no.
MIT-CSAIL-TR-2015-034
Abstract
Much prior work has studied processor cache replacement policies, but a large gap remains between theory and practice. The optimal policy (MIN) requires unobtainable knowledge of the future, and prior theoretically-grounded policies use reference models that do not match real programs. Meanwhile, practical policies are designed empirically. Lacking a strong theoretical foundation, they do not make the best use of the information available to them. This paper bridges theory and practice. We propose that practical policies should replace lines based on their economic value added (EVA), the difference of their expected hits from the average. We use Markov decision processes to show that EVA is optimal under some reasonable simplifications. We present an inexpensive, practical implementation of EVA and evaluate it exhaustively over many cache sizes. EVA outperforms prior practical policies and saves area at iso-performance. These results show that formalizing cache replacement yields practical benefits.
Terms of Use
Creative Commons Attribution 4.0 International
http://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/100465
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.