Imbalanced cache partitioning for balanced data-parallel programs
- 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. 297-309
- https://doi.org/10.1145/2540708.2540734
Abstract
No abstract availableKeywords
Funding Information
- U.S. Department of Energy (DE-FC02-12ER26104)
- Division of Computer and Network Systems (CNS-0751153, CNS-1117726, OCI-1216809)
- Office of Cyberinfrastructure (CNS-0751153, CNS-1117726, OCI-1216809)
This publication has 33 references indexed in Scilit:
- Efficient Reuse Distance Analysis of Multicore Scaling for Loop-Based Parallel ProgramsACM Transactions on Computer Systems, 2013
- Quality of service shared cache management in chip multiprocessor architectureACM Transactions on Architecture and Code Optimization, 2010
- Is Reuse Distance Applicable to Data Locality Analysis on Chip Multiprocessors?Lecture Notes in Computer Science, 2010
- Program locality analysis using reuse distanceACM Transactions on Programming Languages and Systems, 2009
- Path-Based Reuse Distance AnalysisLecture Notes in Computer Science, 2006
- Multifacet's general execution-driven multiprocessor simulator (GEMS) toolsetACM SIGARCH Computer Architecture News, 2005
- Array regrouping and structure splitting using whole-program reference affinityPublished by Association for Computing Machinery (ACM) ,2004
- Dynamic Partitioning of Shared Cache MemoryThe Journal of Supercomputing, 2004
- Predicting whole-program locality through reuse distance analysisPublished by Association for Computing Machinery (ACM) ,2003
- Optimal partitioning of cache memoryIEEE Transactions on Computers, 1992