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

  • Authors:
  • Fred Gustavson;Lars Karlsson;Bo Kågström

  • Affiliations:
  • IBM T.J. Watson Research Center, Emeritus, and Umeå University;Umeå University;Umeå University

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.