Insertion and promotion for tree-based PseudoLRU last-level caches
- 7 December 2013
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-46
- p. 284-296
- https://doi.org/10.1145/2540708.2540733
Abstract
No abstract availableFunding Information
- Texas Higher Education Coordinating Board (010115-0079-2009)
- Division of Computing and Communication Foundations (CCF-1216604, CCF-1012127)
This publication has 19 references indexed in Scilit:
- Improving Cache Management Policies Using Dynamic Reuse DistancesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Cosmology with hypervelocity starsJournal of Cosmology and Astroparticle Physics, 2011
- PIPPPublished by Association for Computing Machinery (ACM) ,2009
- ValgrindPublished by Association for Computing Machinery (ACM) ,2007
- A Case for MLP-Aware Cache ReplacementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Using SimPoint for accurate and efficient simulationACM SIGMETRICS Performance Evaluation Review, 2003
- Automatically characterizing large scale program behaviorPublished by Association for Computing Machinery (ACM) ,2002
- Dead-block prediction & dead-block correlating prefetchersPublished by Association for Computing Machinery (ACM) ,2001
- A language for describing predictors and its application to automatic synthesisPublished by Association for Computing Machinery (ACM) ,1997
- The working set model for program behaviorCommunications of the ACM, 1968