Computation Regrouping: Restructuring programs for temporal data cache locality

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2002, Pages 252-261

  Pingali, Venkata K ^a   Hseih, Wilson C ^a   McKee, Sally A ^a   Carter, John B ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Data structures; Memory performance; Optimization

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; MULTIPROCESSING SYSTEMS;

DATA CACHE LOCALITY;

CACHE MEMORY;

EID: 0036374188     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/514191.514227     Document Type: Conference Paper

References (37)

1. Real-time concurrent collection on stock multiprocessors
2. The buffer tree: A new technique for optimal I/O-algorithms
3. Efficient bulk operations on dynamic r-trees
4. Cache-oblivious b-trees
5. Software prefetching
6. Early experiences with olden
7. Compiler optimizations for improving data locality
8. Recursive array layouts and fast matrix multiplication
9. Cache-conscious structure layout
10. Parallel programming in split-c
11. Improving effective bandwidth through compiler enhancement of global cache reuse
12. FFTW: An adaptive software architecture for the FFT
13. Cache-oblivious algorithms
14. Precise miss analysis for program transformations with caches of arbitrary associativity
15. R-trees: A dynamic index structure for spatial searching
16. Improving compiler and run-time support for irregular reductions
17. Improving locality using loop and data transformations in an integrated framework
18. A prefetching technique for irregular accesses to linked data structures
19. Data-centric multi-level blocking
20. Data-centric multi-level blocking
21. The cache performance and optimizations of blocked algorithms
22. Compiler-based prefetching for recursive data structure
23. Cache conscious indexing for decision-support in main memory
24. Making B+-trees cache conscious in main memory
25. Process decomposition through locality of reference
26. Cache conscious algorithms for relational query processing
27. New tiling techniques to improve cache temporal locality
28. Improving cache behavior of dynamically allocated data structures
29. Performance analysis using the MIPS R10000 performance counters