Parallel and Cache-Efficient In-Place Matrix Storage Format Conversion
Fred Gustavson, Lars Karlsson, Bo Kågström
Source record
Source: Crossref
Published: Apr 1, 2012
DOI: 10.1145/2168773.2168775
Open original source ↗Source abstract
Techniques and algorithms for efficient in-place conversion to and from standard and blocked matrix storage formats are described. Such functionality is required by numerical libraries that use different data layouts internally. Parallel algorithms and a software package for in-place matrix storage format conversion based on in-place matrix transposition are presented and evaluated. A new algorithm for in-place transposition which efficiently determines the structure of the transposition permutation a priori is one of the key ingredients. It enables effective load balancing in a parallel environment.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.