Optimized Binary64 and Binary128 Arithmetic with GNU MPFR - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Optimized Binary64 and Binary128 Arithmetic with GNU MPFR

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
980 Consultations
875 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More