Towards a Reliable Performance Evaluation of Accurate Summation Algorithms

Philippe Langlois 1 Bernard Goossens 1 David Parello 1
1 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : Recent floating point summation algorithms compute the best accurate sum even for arbitrary ill-conditioned problems. So the actual run-time efficiency of these algorithms becomes the criteria to decide which is the best. Neither the classic flop count nor experimental timings are relevant measures of the actual performance of such core numerical algorithms. We justify these claims and present a reliable performance evaluation of some accurate summation algorithms thanks to an automatic instruction level parallelism analysis.
Type de document :
Communication dans un congrès
SCE: Computational Science and Engineering, Feb 2013, Boston, Ma, United States. SIAM Conference on Computational Science and Engineering, 2013, 〈https://www.siam.org/meetings/cse13/〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-01233879
Contributeur : Philippe Langlois <>
Soumis le : mercredi 9 décembre 2015 - 15:00:15
Dernière modification le : samedi 25 novembre 2017 - 10:16:11

Annexe

Identifiants

  • HAL Id : hal-01233879, version 1

Collections

Citation

Philippe Langlois, Bernard Goossens, David Parello. Towards a Reliable Performance Evaluation of Accurate Summation Algorithms. SCE: Computational Science and Engineering, Feb 2013, Boston, Ma, United States. SIAM Conference on Computational Science and Engineering, 2013, 〈https://www.siam.org/meetings/cse13/〉. 〈hal-01233879〉

Partager

Métriques

Consultations de la notice

100

Téléchargements de fichiers

63