Accelerating scientific computations with mixed precision algorithms

  • Marc Baboulin (Contributor)
  • Alfredo Buttari (Contributor)
  • Jack Dongarra (Contributor)
  • Jakub Kurzak (Contributor)
  • Julie Langou (Contributor)
  • Julien Langou (Contributor)
  • Piotr Luszczek (Contributor)
  • Stanimire Tomov (Contributor)

Dataset

Description

Abstract
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 floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly 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 Programmab...

Title of program: ITER-REF
Catalogue Id: AECO_v1_0

Nature of problem
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 floating point arithmetic, the performance of many dense and sparse linear algebra algorithms can be significantly enhanced while maintaining the 64-bit accuracy of the resulting solution.

Versions of this program held in the CPC repository in Mendeley Data
AECO_v1_0; ITER-REF; 10.1016/j.cpc.2008.11.005

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)
Date made available1 Dec 2009
PublisherMendeley Data

Keywords

  • numerical linear algebra
  • mixed precision
  • iterative refinement

Cite this