Logo image
Se connecter
Retour
Efficiency of Reproducible Level 1 BLAS
Acte de colloque   Open Access

Efficiency of Reproducible Level 1 BLAS

Chemseddine Chohra, Philippe Langlois et David Parello
16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics - Revised Selected Papers, Vol.LNCS(9553), pp.99-108
Scientific Computing, Computer Arithmetic, and Validated Numerics
SCAN: Scientific Computing, Computer Arithmetic, and Validated Numerics (Würzburg, Germany, 21/09/2014–26/09/2014)
04/2016
DOI: https://doi.org/10.1007/978-3-319-31769-4_8

Résumé

Floating-Point Arithmetic BLAS Numerical Reproducibility
Numerical reproducibility failures appear in massively par-allel floating-point computations. One way to guarantee the numerical reproducibility is to extend the IEEE-754 correct rounding to larger com-puting sequences, as for instance for the BLAS libraries. Is the overcost for numerical reproducibility acceptable in practice? We present solu-tions and experiments for the level 1 BLAS and we conclude about the efficiency of these reproducible routines.

Fichiers et liens (2)

url
Find in HALAfficher
url
https://doi.org/10.1007/978-3-319-31769-4_8Afficher
Published (Version of record) Ouvrir

Indicateurs

1 Consultations de la notice

Détails

Logo image