Skip to main content
Article thumbnail
Location of Repository

Communication efficient Gaussian elimination with partial pivoting using a shape morphing data layout

By Grey Ballard, Oded Schwartz, James Demmel, Sivan Toledo and Benjamin Lipshitz

Abstract

High performance for numerical linear algebra often comes at the expense of stability. Computing the LU decomposition of a matrix via Gaussian Elimination can be organized so that the computation involves regular and efficient data access. However, maintaining numerical stability via partial pivoting involves row interchanges that lead to inefficient data access patterns. To optimize communication efficiency throughout the memory hierarchy we confront two seemingly contradictory requirements: partial pivoting is efficient with column-major layout, whereas a block-recursive layout is optimal for the rest of the computation. We resolve this by introducing a shape morphing procedure that dynamically matches the layout to the computation throughout the algorithm, and show that Gaussian Elimination with partial pivoting can be performed in a communication efficient and cache-oblivious way. Our technique extends to QR decomposition, where computing Householder vectors prefers a different data layout than the rest of the computation. Categories and Subject Descriptor

Topics: F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Computations on matrices General Terms Algorithms
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6316
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.berkeley.edu/~od... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.