Reproducible and Accurate Matrix Multiplication - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Reproducible and Accurate Matrix Multiplication

Résumé

Due to non-associativity of floating-point operations and dynamic scheduling on parallel architectures, getting a bit-wise reproducible floating-point result for multiple executions of the same code on different or even similar parallel architectures is challenging. In this paper, we address the problem of reproducibility in the context of matrix multiplication and propose an algorithm that yields both reproducible and accurate results. This algorithm is composed of two main stages: a filtering stage that uses fast vectorized floating-point expansions in conjunction with error-free transformations; an accumulation stage based on Kulisch long accumulators in a high-radix carry-save representation. Finally, we provide implementations and performance results in parallel environments like GPUs.
Fichier principal
Vignette du fichier
IDCG16.pdf (302.21 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01539180 , version 1 (30-05-2019)

Identifiants

Citer

Roman Iakymchuk, David Defour, Caroline Collange, Stef Graillat. Reproducible and Accurate Matrix Multiplication. SCAN: Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Wurzburg, Germany. pp.126-137, ⟨10.1007/978-3-319-31769-4_11⟩. ⟨hal-01539180⟩
550 Consultations
654 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More