Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion

DOI10.1145/2168773.2168775zbMath1365.65323OpenAlexW2028122240WikidataQ113310403 ScholiaQ113310403MaRDI QIDQ2989158

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)

Related Items (3)

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

This page was built for publication: Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion