A new binary floating-point division algorithm and its software implementation on the ST231 processor

Claude-Pierre Jeannerod 1, 2 Hervé Knochel 3 Christophe Monat 3 Guillaume Revy 1, 2, * Gilles Villard 1, 2
* Corresponding author
2 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00335892
Contributor : Claude-Pierre Jeannerod <>
Submitted on : Wednesday, March 18, 2009 - 1:53:29 PM
Last modification on : Thursday, January 17, 2019 - 3:16:03 PM
Long-term archiving on : Saturday, November 26, 2016 - 6:46:09 AM

File

fpdiv-hal-V2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00335892, version 2

Collections

Citation

Claude-Pierre Jeannerod, Hervé Knochel, Christophe Monat, Guillaume Revy, Gilles Villard. A new binary floating-point division algorithm and its software implementation on the ST231 processor. 2009. ⟨ensl-00335892v2⟩

Share

Metrics

Record views

299

Files downloads

223