Asset description file for SuperLU_MT


Contents of this Asset file:

Field Name Value HTML Tag Type
BIDM.Asset.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. META
BIDM.Asset.ContactIs.Organization http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/james_demmel.html LINK
BIDM.Asset.ContactIs.Organization http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/john_gilbert.html LINK
BIDM.Asset.ContactIs.Organization http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/xiaoye_li.html LINK
BIDM.Asset.DateOfInformation Mon Sep 15 09:18:08 1997 META
BIDM.Asset.Domain Numerical Programs and Routines!Linear algebra META
BIDM.Asset.Name SuperLU_MT META
BIDM.Asset.RecordMaintainedBy.Organization http://www.nhse.org/rib/repositories/hpc-netlib/objects/Organization/hpc-netlib.html LINK
BIDM.Asset.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 META
BIDM.Asset.TitleLine parallel sparse Gaussian Elimination for shared memory machines META
BIDM.Asset.Version alpha release META
BIDM.Asset.Webpage ftp://pub/src/lapack/SuperLU/superlu_mt.tar.gz META