On the Limits of Cache-Oblivious Matrix Transposition

DOI10.1007/978-3-540-75336-0_15MaRDI QIDQ3608461zbMATH OpenOpenAlexFDO

Authors Francesco Silvestri

Publication date 5 March 2009

Published in Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75336-0_15

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Computational Science - ICCS 2004
• An efficient algorithm for out-of-core matrix transposition
• The combinatorics of cache misses during matrix multiplication
• Cache-oblivious selection in sorted \(X+Y\) matrices
• On the limits of cache-obliviousness
• Cache oblivious matrix multiplication using an element ordering based on a Peano curve
• Cache oblivious sparse matrix multiplication
• On fast multiplication of a matrix by its transpose
• Cache-Aided Matrix Multiplication Retrieval
• Parallel matrix transpose algorithms on distributed memory concurrent computers

Cites work

• scientific article; zbMATH DE number 1756010 (Why is no real title available?)
• Cache-oblivious algorithms
• On the limits of cache-obliviousness

Cited in

(6)

• Cache oblivious minimum cut
• Computational Science - ICCS 2004
• Cache-oblivious algorithms
• Parallel Processing and Applied Mathematics
• On the limits of cache-oblivious rational permutations
• The complexity of matrix transposition on one-tape off-line Turing machines

This page was built for publication: On the Limits of Cache-Oblivious Matrix Transposition

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