Array regrouping and structure splitting using whole-program reference affinity
- 9 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 39 (6) , 255-266
- https://doi.org/10.1145/996841.996872
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- 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
- Data remapping for design space optimization of embedded memory systemsACM Transactions on Embedded Computing Systems, 2003
- LIRSPublished by Association for Computing Machinery (ACM) ,2002
- 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
- Communication Optimizations for Irregular Scientific Computations on Distributed Memory ArchitecturesJournal of Parallel and Distributed Computing, 1994
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971