Accelerating Correctly Rounded Floating-PointDivision when the Divisor is Known in Advance - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2004

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

(1, 2) , (3) , (1)
1
2
3
Jean-Michel Muller
Nicolas Brisebarre
Saurabh Raina
• Function : Author
• PersonId : 834535

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.

Dates and versions

ensl-00087465 , version 1 (24-07-2006)

Identifiers

• HAL Id : ensl-00087465 , version 1
• DOI :

Cite

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

135 View