The combinatorics of cache misses during matrix multiplication

DOI10.1006/JCSS.2001.1756zbMATH Open0996.68001OpenAlexW2162230872MaRDI QIDQ5952453FDOQ5952453

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

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

zbMATH Keywords

cache misses

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• Dataflow analysis of array and scalar references

Cited In (7)

• Cache-Aided Matrix Multiplication Retrieval
• Weak minimization of DFA -- an algorithm and applications
• CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP
• On the Limits of Cache-Oblivious Matrix Transposition
• Numerical Analysis and Its Applications
• Title not available (Why is that?)
• 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)