Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Accuracy Versus Time: A Case Study with Summation Algorithms

Abstract : In this article, we focus on numerical algorithms for which, in practice, parallelism and accuracy do not cohabit well. In order to increase parallelism, expressions are reparsed implicitly using mathematical laws like associativity and this reduces the accuracy. Our approach consists in performing an exhaustive study: we generate all the algorithms equivalent to the original one and compatible with our relaxed time constraint. Next we compute the worst errors which may arise during their evaluation, for several relevant sets of data. Our main conclusion is that relaxing very slightly the time constraints by choosing algorithms whose critical paths are a bit longer than the optimal makes it possible to strongly optimize the accuracy. We extend these results to the case of bounded parallelism and to accurate sum algorithms that use compensation techniques.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00477511
Contributeur : Philippe Langlois <>
Soumis le : jeudi 29 avril 2010 - 13:40:16
Dernière modification le : mercredi 2 décembre 2015 - 12:53:25
Archivage à long terme le : : lundi 22 octobre 2012 - 15:30:49

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Philippe Langlois, Matthieu Martel, Laurent Thévenoux. Accuracy Versus Time: A Case Study with Summation Algorithms. PASCO'10 : Parallel Symbolic Computation 2010, Jul 2010, Grenoble, France. pp.121-130, ⟨10.1145/1837210.1837229⟩. ⟨hal-00477511⟩

Partager

Métriques

Consultations de la notice

203

Téléchargements de fichiers

965