Computing Time for Summation Algorithm: Less Hazard and More Scientific Research

Bernard Goossens 1 Philippe Langlois 2, 1 David Parello 2, 1 Kathy Porada 2
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 : Several accurate algorithms to sum IEEE-754 floating point numbers have been recently published. The contributions by Rump, Ogita and Oishi [3, 4, 2] and the newest ones proposed by Zhu and Hayes [5, 6] are examples of accurate summation algorithms. Some of these actually compute the correct rounding of the exact sum, i.e., the most accurate value with respect to the finite precision of the floating point arithmetic. This computed sum does not suffer anymore from the condition number of the summation. In such cases, the run-time performances and the memory print become the discriminant properties to decide which algorithm to choose. In this talk we focus the problem of presenting reliable measures of the run-time performances of such core algorithms. As Rump writes in [2], “Measuring the computing time of summation algorithms in a high-level language on today’s architectures is more of a hazard than scientific research.” We introduced PerPI, a software tool that automatizes an almost machine independent analysis based on the instruction-level parallelism of the algorithm [1]. We analyze the previously mentioned accurate summation algorithms. We discuss whether PerPI provides a more reliable performance analysis and how to improve the confidence level of future contributions in this area.
Type de document :
Communication dans un congrès
Numerical Sofware: Design, Analysis and Verification, Jul 2012, Santander, Spain. 2012, Numerical Software: Design, Analysis and Verification IFIP WG2.5, Santander, July 4–6 2012. 〈http://personales.unican.es/segurajj/numsoft12/〉
Liste complète des métadonnées

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

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00835508
Contributeur : Philippe Langlois <>
Soumis le : mercredi 25 novembre 2015 - 19:22:29
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : samedi 29 avril 2017 - 03:44:47

Fichier

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

Identifiants

  • HAL Id : lirmm-00835508, version 1

Collections

Citation

Bernard Goossens, Philippe Langlois, David Parello, Kathy Porada. Computing Time for Summation Algorithm: Less Hazard and More Scientific Research. Numerical Sofware: Design, Analysis and Verification, Jul 2012, Santander, Spain. 2012, Numerical Software: Design, Analysis and Verification IFIP WG2.5, Santander, July 4–6 2012. 〈http://personales.unican.es/segurajj/numsoft12/〉. 〈lirmm-00835508〉

Partager

Métriques

Consultations de la notice

200

Téléchargements de fichiers

298