On the Limits of Cache-Oblivious Matrix Transposition

DOI10.1007/978-3-540-75336-0_15zbMATH Open1211.68504OpenAlexW2127483723MaRDI QIDQ3608461FDOQ3608461

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

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

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Cache-Oblivious Algorithms
• On the limits of cache-obliviousness
• Title not available (Why is that?)

Cited In (5)

• Computational Science - ICCS 2004
• 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
• Cache Oblivious Minimum Cut

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)