Towards a Reliable Performance Evaluation of Accurate Summation Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Towards a Reliable Performance Evaluation of Accurate Summation Algorithms

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.
cse13_sl.pdf (1.22 Mo) Télécharger le fichier
Format : Presentation
Origin : Files produced by the author(s)

Dates and versions

hal-01233879 , version 1 (09-12-2015)

Identifiers

  • HAL Id : hal-01233879 , version 1

Cite

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⟩
196 View
86 Download

Share

Gmail Facebook Twitter LinkedIn More