Reducing the mean latency of floating-point addition

✍ Scribed by Stuart F. Oberman; Michael J. Flynn

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 866 KB
• Volume: 196
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(97)00201-6

✦ Synopsis

Addition is the most frequent floating-point operation in modem microprocessors.

Due to its complex shift-add-shift-round data flow, floating-point addition can have a long latency. To achieve maximum system performance, it is necessary to design the floating-point adder to have minimum latency, while still providing maximum throughput. This paper proposes a new floating-point addition algorithm which exploits the ability of dynamically scheduled processors to utilize functional units which complete in variable time. By recognizing that certain operand combinations do not require all of the steps in the complex addition data flow, the mean latency is reduced. Simulation on SPECfp92 applications demonstrates that a speedup in mean addition latency of 1.33 can be achieved using this algorithm, while maintaining single-cycle throughput.