Cache-efficient matrix transposition

IEEE High-Performance Computer Architecture Symposium Proceedings

Volumn , Issue , 2000, Pages 195-205

  Chatterjee, Siddhartha ^a   Sen, Sandeep ^a  

^a Brooks Computer Science Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DATA STRUCTURES; MATRIX ALGEBRA; OPTIMIZATION; TIME SERIES ANALYSIS;

ARRAY LAYOUT FUNCTION; CACHE EFFICIENT MATRIX TRANSPOSITION; DATA CACHE; REGISTER TILING; TRANSLATION LOOKASIDE BUFFER;

DATA FLOW ANALYSIS;

EID: 0034581167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. A model for hierarchical memory
2. Hierarchical memory with block transfer
3. The input/output complexity of sorting and related problems
4. The uniform memory hierarchy model of computation
5. Empirical evaluation of the CRAY-T3D: A compiler perspective
6. Balancing processor loads and exploiting data locality in N-body simulations
7. Simple randomized mergesort on parallel disks
8. Towards an optimal bit-reversal permutation program
9. Nonlinear array layouts for hierarchical memory systems
10. Recursive array layouts and fast parallel matrix multiplication
11. External memory graph algorithms
12. Asymptotically tight bounds for performing BMMC permutations on parallel disk systems
13. Permuting information in idealized two-level storage
14. Auto-blocking matrix-multiplication or tracking BLAS3 performance with source code
15. Influence of cross-interference on blocked loops: A case study with matrix-vector multiply
16. Cache-oblivious algorithms
17. Memory hierarchy considerations for fast transpose and bit-reversals
18. External memory computational geometry
19. Über stetige Abbildung einer Linie auf ein Flächenstück
20. Wisconsin architectural research tool set
21. I/O complexity: The red blue pebble game
22. High performance fortran for highly irregular problems
23. Load balancing and data locality via fractiling: An experimental study
24. The cache performance and optimizations of blocked algorithms
25. The cache performance and optimizations of blocked algorithms
26. Cache profiling and the SPEC benchmarks: A case study
27. Sur une courbe qui remplit toute une aire plaine
28. Dynamic partitioning of non-uniform structured workloads with spacefilling curves
29. Towards a theory of cache-efficient algorithms
30. An empirical comparison of the Kendall Square Research KSR-1 and the Stanford DASH multiprocessors
31. Increasing TLB reach using superpages backed by shadow memory
32. Large scale sorting in uniform memory hierarchies
33. Algorithms for parallel memory I: Two-level memories
34. A parallel hashed Oct-tree N-body algorithm