Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A first-order fine-grained multithreaded throughput modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- The PARSEC benchmark suitePublished by Association for Computing Machinery (ACM) ,2008
- Improving Performance Isolation on Chip Multiprocessors via an Operating System Scheduler16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), 2007
- Feedback-directed memory disambiguation through store distance analysisPublished by Association for Computing Machinery (ACM) ,2006
- Discovery of Locality-Improving Refactorings by Reuse Path AnalysisLecture Notes in Computer Science, 2006
- Fast data-locality profiling of native executionACM SIGMETRICS Performance Evaluation Review, 2005
- Predicting Inter-Thread Cache Contention on a Chip Multi-Processor ArchitecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Predicting whole-program locality through reuse distance analysisPublished by Association for Computing Machinery (ACM) ,2003
- The Elements of Statistical LearningPublished by Springer Science and Business Media LLC ,2001
- ThrashingPublished by Association for Computing Machinery (ACM) ,1968