| Identifiant de l'article : |
 |
ensl-00335892, version 2 |
|
|
| Domaine : |
|
Informatique/Arithmétique des ordinateurs
|
|
|
| Titre : |
|
A new binary floating-point division algorithm and its software implementation on the ST231 processor |
|
|
| Auteur(s) : |
|
Claude-Pierre Jeannerod1, 2, Hervé Knochel3, Christophe Monat3, Guillaume Revy1, 2, Gilles Villard1, 2 |
|
|
| Laboratoire : |
|
| 1 : |
LIP - Laboratoire de l'Informatique du Parallélisme |
|
| 2 : |
Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme - ARENAIRE |
|
| 3 : |
ST-GRENOBLE - STMicroelectronics (Grenoble) |
|
|
|
| Équipe de recherche : |
|
[ARENAIRE - Arithmétique des ordinateurs] |
| Résumé : |
|
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targets a VLIW integer processor of the ST200 family, and is based on fast and accurate programs for evaluating some particular bivariate polynomials. We start by giving approximation and evaluation error conditions that are sufficient to ensure correct rounding. Then we describe the heuristics used to generate such evaluation programs, as well as those used to automatically validate their accuracy. Finally, we propose, for the binary32 format, a complete C implementation of the resulting division algorithm. With the ST200 compiler and compared to previous implementations, the speed-up observed with our approach is by a factor of almost 1.8. |
|
|
|
Langue du texte
intégral : |
|
Anglais |
|
|
| Mots-clés : |
|
binary floating-point division – correct rounding – polynomial evaluation – code generation and validation – VLIW integer processor. |
|
|
| Classification : |
|
B.2.4, G.1.0, G.4 |
|
|
| Référence interne : |
|
LIP research report RR2008-39 |
|
|
|
Récupérer au format
