Personal tools
You are here: Home Publications QR factorization for the Cell Broadband Engine
Document Actions

J. Kurzak and J. Dongarra (2009)

QR factorization for the Cell Broadband Engine

Sci. Program, 17:1-2.

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.

by Jennifer Harris last modified 2009-04-20 19:30
« August 2017 »
Su Mo Tu We Th Fr Sa
12345
6789101112
13141516171819
20212223242526
2728293031
 

Powered by Plone

CScADS Collaborators include:

Rice University ANL UCB UTK WISC