SuperLU_MT

Abstract

SuperLU_MT is an implementation of parallel sparse Gaussian Elimination for shared memory machines. SuperLU_MT is based on the serial library SuperLU. SuperLU contains a set of subroutines to solve a sparse, possibly nonsymmetric, linear system A*X=B. It implements Gaussian elimination with partial pivoting. The algorithm includes efficient structure-prediction and memory-locality optimization techniques.

DateOfInformation

Mon Sep 15 09:18:08 1997

Domain

Numerical Programs and Routines!Linear algebra

Name

SuperLU_MT

TargetEnvironment

SuperLU_MT is implemented in ANSI C, with multithreading (e.g. POSIX threads) used to express parallelism. Currently, only the LU factorization routine, the most time-consuming part of the solution process, has been parallelized. The library has been testedon the Sun Ultra Enterprise servers, the DEC Alpha Servers, the Cray C90/J90, the SGI Power Challenge, and the SGI/Cray Orgin2000. The library is readily portable to the other platforms using our POSIX threads interface. This "alpha" release contains only the double-precision real data type

Version

alpha release

Webpage

ftp://pub/src/lapack/SuperLU/superlu_mt.tar.gz

ContactIs

James Demmel
John Gilbert
Xiaoye S. Li