A hierarchical model of data locality
- 11 January 2006
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 41 (1), 16-29
- https://doi.org/10.1145/1111037.1111040
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Improving the computational intensity of unstructured mesh applicationsPublished by Association for Computing Machinery (ACM) ,2005
- Array regrouping and structure splitting using whole-program reference affinityPublished by Association for Computing Machinery (ACM) ,2004
- Improving effective bandwidth through compiler enhancement of global cache reuseJournal of Parallel and Distributed Computing, 2003
- Predicting whole-program locality through reuse distance analysisPublished by Association for Computing Machinery (ACM) ,2003
- Compile-time composition of run-time data and iteration reorderingsPublished by Association for Computing Machinery (ACM) ,2003
- On the complexity of loop fusionParallel Computing, 2000
- Procedure placement using temporal-ordering informationACM Transactions on Programming Languages and Systems, 1999
- Automatic data layout for distributed-memory machinesACM Transactions on Programming Languages and Systems, 1998
- Improving data locality with loop transformationsACM Transactions on Programming Languages and Systems, 1996
- The uniform memory hierarchy model of computationAlgorithmica, 1994