Managing the complexity of lookahead for LU factorization with pivoting

  • Authors:

  • Ernie Chan;Robert van de Geijn;Andrew Chapman

  • Affiliations:

  • The University of Texas at Austin, Austin, TX, USA;The University of Texas at Austin, Austin, TX, USA;Microsoft Corporation, Redmond, WA, USA

  • Venue:
  • Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.