Exact and Approximated error of the FMA

Sylvie Boldo 1, 2 Jean-Michel Muller 3, 4
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
4 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already available on some current processors such as the Power PC or the Itanium. We first extend an earlier work on the computation of the exact error of an FMA (by giving more general conditions and providing a formal proof). Then, we present a new algorithm that computes an approximation to the error of an FMA, and provide error bounds and a formal proof for that algorithm.
Document type :
Journal articles
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.157-164. <10.1109/TC.2010.139>
Liste complète des métadonnées


https://hal.inria.fr/inria-00429617
Contributor : Sylvie Boldo <>
Submitted on : Tuesday, November 3, 2009 - 4:45:02 PM
Last modification on : Thursday, February 9, 2017 - 3:55:12 PM
Document(s) archivé(s) le : Tuesday, October 16, 2012 - 1:10:55 PM

File

fma_err.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sylvie Boldo, Jean-Michel Muller. Exact and Approximated error of the FMA. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.157-164. <10.1109/TC.2010.139>. <inria-00429617>

Share

Metrics

Record views

526

Document downloads

204