Sciweavers

SPAA
2010
ACM

Managing the complexity of lookahead for LU factorization with pivoting

13 years 8 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) using classical partial pivoting versus recently proposed incremental pivoting and (2) extracting parallelism only within the Basic Linear Algebra Subprograms versus building and scheduling a directed acyclic graph of tasks. Performance comparisons are given on two different systems. Categories and Subject Descriptors
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SPAA
Authors Ernie Chan, Robert A. van de Geijn, Andrew Chapman
Comments (0)