The combinatorics of cache misses during matrix multiplication

Journal of Computer and System Sciences

Volumn 63, Issue 1, 2001, Pages 80-126

  Hanlon, Philip J ^a   Chung, Dean ^b   Chatterjee, Siddhartha ^c   Genius, Daniela ^c   Lebeck, Alvin R ^d   Parker, Erin ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b AMAZON   (United States)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

^d Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; MATRIX ALGEBRA;

ARRAY LAYOUT FUNCTION; BINARY EXPANSIONS; BIT INTERLEAVING; CACHE MISSES; MATRIX MULTIPLICATION;

CACHE MEMORY;

EID: 0035416223     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1756     Document Type: Article

References (9)

1. Nonlinear array layouts for hierarchical memory systems
2. Recursive array layouts and fast parallel matrix multiplication
3. Dataflow analysis of array and scalar references
4. Auto-blocking matrix-multiplication or tracking BLAS3 performance with source code
5. Cache miss equations: A compiler framework for analyzing and tuning memory behavior
6. Evaluating associativity in CPU caches
7. The cache performance and optimization of blocked algorithms
8. The Omega test: A fast practical integer programming algorithm for dependence analysis