3.6) Why is floating-point addition generally slower than integer addition? Afte

Question

3.6) Why is floating-point addition generally slower than integer addition? After a floating-point computation, the hardware normalizes the binary-point number 0.00001. Which direction is the mantissa shifted, and by how many bit positions? How does the exponent need to be corrected? 3.7) What decimal floating-point number is represented by the IEEE 754 half-precision value 0xBB00? [Half-precision floats are represented like IEEE 754 single-precision floats, only they are 16 bits wide. The leftmost bit is the sign bit, the exponent is 5 bits wide and has a bias of 15, and the fraction is 10 bits long.] 3.8)

Explanation / Answer

3.6)

The FP addition is slow compare with integer addition and It varies strongly from processor to processor (because different processors have different "pipeline" lengths. Also, some operations are generally very simple (such as addition). In few cased FP addition performance is same as integer addition.

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.