QR factorization for the Cell Broadband Engine

  • Authors:

  • Jakub Kurzak;Jack Dongarra

  • Affiliations:

  • (Corresponding author. E-mail: kurzak@eecs.utk.edu) Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA;Dept. of Elec. Eng. and Comp. Sci., Univ. of Tennessee, Knoxville, TN, USA and Comp. Sci. and Mathematics Div., Oak Ridge National Lab., Oak Ridge, TN, USA and Sch. of Math. and Sch. of Comp. Sci. ...

  • Venue:
  • Scientific Programming - High Performance Computing with the Cell Broadband Engine
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The QR factorization is one of the most important operations in dense linear algebra, offering a numerically stable method for solving linear systems of equations including overdetermined and underdetermined systems. Modern implementations of the QR factorization, such as the one in the LAPACK library, suffer from performance limitations due to the use of matrix-vector type operations in the phase of panel factorization. These limitations can be remedied by using the idea of updating of QR factorization, rendering an algorithm, which is much more scalable and much more suitable for implementation on a multi-core processor. It is demonstrated how the potential of the cell broadband engine can be utilized to the fullest by employing the new algorithmic approach and successfully exploiting the capabilities of the chip in terms of single instruction multiple data parallelism, instruction level parallelism and thread-level parallelism.