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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Baboulin, Marc (author)
Outros Autores: Buttari, Alfredo (author), Dongarra, Jack (author), Kurzak, Jakub (author), Langou, Julie (author), Luszczek, Piotr (author), Tomov, Stanimire (author), Langou, Julien (author)
Formato: other
Idioma:eng
Publicado em: 2008
Texto completo:http://hdl.handle.net/10316/11224
País:Portugal
Oai:oai:estudogeral.sib.uc.pt:10316/11224
Descrição
Resumo: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.

Registros relacionados