Optimized Binary64 and Binary128 Arithmetic with GNU MPFR - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Optimized Binary64 and Binary128 Arithmetic with GNU MPFR

Abstract

We describe algorithms used to optimize the GNU MPFR library when the operands fit into one or two words. On modern processors, a correctly rounded addition of two quadruple precision numbers is now performed in 22 cycles, a subtraction in 24 cycles, a multiplication in 32 cycles, a division in 64 cycles, and a square root in 69 cycles. We also introduce a new faithful rounding mode, which enables even faster computations. Those optimizations will be available in version 4 of MPFR.
Fichier principal
Vignette du fichier
mpfr4.pdf (270.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01502326 , version 1 (05-04-2017)

Identifiers

Cite

Vincent Lefèvre, Paul Zimmermann. Optimized Binary64 and Binary128 Arithmetic with GNU MPFR. 24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom. pp.18-26, ⟨10.1109/ARITH.2017.28⟩. ⟨hal-01502326⟩
932 View
833 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More