The combinatorics of cache misses during matrix multiplication

DOI10.1006/JCSS.2001.1756MaRDI QIDQ5952453zbMATH OpenOpenAlexFDO

Authors Philip J. Hanlon, Dean Chung, Siddhartha Chatterjee, Daniela Genius, Alvin R. Lebeck, Erin Parker

Publication date 27 February 2002

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.2001.1756

zbMATH Keywords

cache misses

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Cache-oblivious algorithms
• Numerical Analysis and Its Applications
• Towards a theory of cache-efficient algorithms
• scientific article; zbMATH DE number 1943112
• The cache complexity of multithreaded cache oblivious algorithms

Cites work

• Dataflow analysis of array and scalar references
• scientific article; zbMATH DE number 53772 (Why is no real title available?)

Cited in

(7)

• scientific article; zbMATH DE number 4170913 (Why is no real title available?)
• On the Limits of Cache-Oblivious Matrix Transposition
• Cache-Aided Matrix Multiplication Retrieval
• CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP
• Numerical Analysis and Its Applications
• Weak minimization of DFA -- an algorithm and applications
• The impact of memory organization on the performance of matrix calculations

This page was built for publication: The combinatorics of cache misses during matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952453)