Block value based insertion policy for high performance last-level caches
- 10 June 2014
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 28th ACM international conference on Supercomputing - ICS '14
Abstract
No abstract availableKeywords
Funding Information
- National Science and Technology Major Project of the Ministry of Science and Technology of China (2009ZX01029-001-002-2)
This publication has 35 references indexed in Scilit:
- Insertion and promotion for tree-based PseudoLRU last-level cachesPublished by Association for Computing Machinery (ACM) ,2013
- Exploiting reuse locality on inclusive shared last-level cachesACM Transactions on Architecture and Code Optimization, 2013
- Optimal bypass monitor for high performance last-level cachesPublished by Association for Computing Machinery (ACM) ,2012
- Why on-chip cache coherence is here to stayCommunications of the ACM, 2012
- The gem5 simulatorACM SIGARCH Computer Architecture News, 2011
- SPEC CPU2006 benchmark descriptionsACM SIGARCH Computer Architecture News, 2006
- Using SimPoint for accurate and efficient simulationACM SIGMETRICS Performance Evaluation Review, 2003
- Data prefetch mechanismsACM Computing Surveys, 2000
- Run-time cache bypassingInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1999
- Utilizing reuse information in data cache managementPublished by Association for Computing Machinery (ACM) ,1998