Predicting whole-program locality through reuse distance analysis
Authors:
Open Access
- 9 May 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 38 (5) , 245-257
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Compile-time composition of run-time data and iteration reorderings2003
- LIRS2002
- Dynamic hot data stream prefetching for general-purpose programs2002
- A compiler approach to fast hardware design space exploration in FPGA-based systems2002
- Quantifying loop nest locality using SPEC'95 and the perfect benchmarksACM Transactions on Computer Systems, 1999
- Improving the ratio of memory operations to floating-point operations in loopsACM Transactions on Programming Languages and Systems, 1994
- Communication Optimizations for Irregular Scientific Computations on Distributed Memory ArchitecturesJournal of Parallel and Distributed Computing, 1994
- Estimating interlock and improving balance for pipelined architecturesJournal of Parallel and Distributed Computing, 1988
- Self-adjusting binary search treesJournal of the ACM, 1985
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971