On the Computation of Correctly-Rounded Sums

Peter Kornerup 1 Vincent Lefèvre 2 Nicolas Louvet 2 Jean-Michel Muller 2
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper presents a study of some basic blocks needed in the design of floating-point summation algorithms. In particular, we show that among the set of the algorithms with no comparisons performing only floating-point additions/subtractions, the 2Sum algorithm introduced by Knuth is minimal, both in terms of number of operations and depth of the dependency graph. Under reasonable conditions, we also prove that no algorithms performing only round-to-nearest additions/subtractions exist to compute the round-to-nearest sum of at least three floating-point numbers. Starting from an algorithm due to Boldo and Melquiond, we also present new results about the computation of the correctly-rounded sum of three floating-point numbers.
Document type :
Conference papers
19th IEEE Symposium on Computer Arithmetic - Arith'19, Jun 2009, Portland, Oregon, United States. 2009
Liste complète des métadonnées


https://hal.inria.fr/inria-00367584
Contributor : Vincent Lefèvre <>
Submitted on : Monday, March 23, 2009 - 3:46:55 PM
Last modification on : Tuesday, May 19, 2009 - 10:58:35 AM
Document(s) archivé(s) le : Wednesday, September 22, 2010 - 12:01:52 PM

Files

arith19.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00367584, version 2

Collections

Citation

Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller. On the Computation of Correctly-Rounded Sums. 19th IEEE Symposium on Computer Arithmetic - Arith'19, Jun 2009, Portland, Oregon, United States. 2009. <inria-00367584v2>

Share

Metrics

Record views

405

Document downloads

189