Article

BIT Numerical Mathematics

, Volume 40, Issue 1, pp 158-176

Efficient Sparse LU Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors

  • O. SchenkAffiliated withIntegrated Systems Laboratory, Swiss Federal Institute of Technology Zürich, ETH Zürich
  • , K. GärtnerAffiliated withWeierstrass Institute for Applied Analysis and Stochastics
  • , W. FichtnerAffiliated withIntegrated Systems Laboratory, Swiss Federal Institute of Technology Zürich, ETH Zürich

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

An efficient sparse LU factorization algorithm on popular shared memory multi-processors is presented. Pipelining parallelism is essential to achieve higher parallel efficiency and it is exploited with a left-right looking algorithm. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm has been successfully tested on SUN Enterprise, DEC AlphaServer, SGI Origin 2000 and Cray T90 and J90 parallel computers, delivering up to 2.3 GFlop/s on an eight processor DEC AlphaServer for medium-size semiconductor device simulations and structural engineering problems.

Parallel sparse LU factorization asynchronous computation scheduling SMP parallel computing multigrid coarse solver process simulation device simulation