Accelerating Correctly Rounded Floating-PointDivision when the Divisor is Known in Advance

Abstract : We present techniques for accelerating the floating-point computation of x/y when y is known before x. The proposed algorithms are oriented toward architectures with available fused-mac operations. The goal is to get exactly the same result as with usual division with rounding to nearest. It is known that the advanced computation of 1/y allows performing correctly rounded division in one multiplication plus two fused-macs. We show algorithms that reduce this latency to one multiplication and one fused-mac. This is achieved if a precision of at least n+1 bits is available, where n is the number of mantissa bits in the target format, or if y satisfies some properties that can be easily checked at compile-time. This requires a double-word approximation of 1/y (we also show how to get it). Compilers to accelerate some numerical programs without loss of accuracy can use these techniques.
Document type :
Journal articles
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00087465
Contributor : Jean-Michel Muller <>
Submitted on : Monday, July 24, 2006 - 4:27:52 PM
Last modification on : Thursday, February 7, 2019 - 2:25:01 PM
Long-term archiving on : Tuesday, April 6, 2010 - 12:24:15 AM

Identifiers

Citation

Jean-Michel Muller, Nicolas Brisebarre, Saurabh Raina. Accelerating Correctly Rounded Floating-PointDivision when the Divisor is Known in Advance. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2004, 53 (8), pp.1069- 1072. ⟨10.1109/TC.2004.37⟩. ⟨ensl-00087465⟩

Share

Metrics

Record views

278

Files downloads

370