Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01233879
Contributor : Philippe Langlois <>
Submitted on : Wednesday, December 9, 2015 - 3:00:15 PM
Last modification on : Thursday, May 24, 2018 - 3:59:23 PM

Annex

Identifiers

  • 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, SIAM, Feb 2013, Boston, Ma, United States. ⟨hal-01233879⟩

Share

Metrics

Record views

268

Files downloads

98