Optimized Binary64 and Binary128 Arithmetic with GNU MPFR

Vincent Lefèvre 1 Paul Zimmermann 2
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
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.
Type de document :
Communication dans un congrès
24th IEEE Symposium on Computer Arithmetic (ARITH 24), Jul 2017, London, United Kingdom
Liste complète des métadonnées


https://hal.inria.fr/hal-01502326
Contributeur : Paul Zimmermann <>
Soumis le : mercredi 5 avril 2017 - 12:51:13
Dernière modification le : jeudi 15 juin 2017 - 09:09:24

Fichier

mpfr4.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01502326, version 1

Citation

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. <hal-01502326>

Partager

Métriques

Consultations de
la notice

211

Téléchargements du document

46