Trade-off Between Accuracy and Time for Automatically Generated Summation Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Trade-off Between Accuracy and Time for Automatically Generated Summation Algorithms

Résumé

We focus on numerical algorithms for which performances and accuracy do not cohabit well in practice. A widely studied example is the floating-point summation. In order to increase parallelism, expressions are reparsed implicitly using arithmetic properties like associativity or distributivity. In IEEE-754 floating-point arithmetic, these laws do not hold any longer for any arithmetic expression. The numerical accuracy of the algorithm may be strongly sensitive to reparsing. So increasing the parallelism of some algorithm may decrease its numerical accuracy, and, conversely, improving the accuracy of some computation may reduce its parallelism. We present an experimental analysis of this problem for the oating-point summation.
Fichier non déposé

Dates et versions

hal-00821668 , version 1 (11-05-2013)

Identifiants

  • HAL Id : hal-00821668 , version 1

Citer

Philippe Langlois, Matthieu Martel, Laurent Thévenoux. Trade-off Between Accuracy and Time for Automatically Generated Summation Algorithms. SCAN: Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2010, Lyon, France. ⟨hal-00821668⟩
91 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More