Accelerating scientific computations with mixed precision algorithms

On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit oating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be signi cantly enhanced...

Full description

Bibliographic Details
Main Author: Baboulin, Marc (author)
Other Authors: Buttari, Alfredo (author), Dongarra, Jack (author), Kurzak, Jakub (author), Langou, Julie (author), Luszczek, Piotr (author), Tomov, Stanimire (author), Langou, Julien (author)
Format: other
Language:eng
Published: 2008
Online Access:http://hdl.handle.net/10316/11224
Country:Portugal
Oai:oai:estudogeral.sib.uc.pt:10316/11224
Description
Summary:On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit oating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be signi cantly enhanced while maintaining the 64-bit accuracy of the resulting solution. The approach presented here can apply not only to conventional processors but also to other technologies such as Field Programmable Gate Arrays (FPGA), Graphical Processing Units (GPU), and the STI Cell BE processor. Results on modern processor architectures and the STI Cell BE are presented.