Parallel and cache-efficient in-place matrix storage format conversion

DOI10.1145/2168773.2168775MaRDI QIDQ2989158zbMATH OpenOpenAlexWikidataFDO

Authors Fred G. Gustavson, Bo Kågström, Lars Karlsson

Publication date 19 May 2017

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2168773.2168775

zbMATH Keywords

blocked matrix data layoutin-place matrix transpositionparallel and cache-efficient algorithms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)

Recommendations

• A general transposition method for a matrix on auxiliary store
• Parallel matrix transpose algorithms on distributed memory concurrent computers
• scientific article; zbMATH DE number 4066229
• scientific article; zbMATH DE number 2086815
• scientific article; zbMATH DE number 1760072

Cited in

(4)

• Highly efficient GPU eigensolver for three-dimensional photonic crystal band structures with any Bravais lattice
• Linear systems solvers for distributed-memory machines with GPU accelerators
• Transposition as a permutation: a tale of group actions and modular arithmetic
• Cache-Aided Matrix Multiplication Retrieval

This page was built for publication: Parallel and cache-efficient in-place matrix storage format conversion

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