DocumentCode
3297122
Title
Massively parallel sparse LU factorization
Author
Kratzer, Steven G.
Author_Institution
Supercomput. Res. Center, Bowie, MD, USA
fYear
1992
fDate
19-21 Oct 1992
Firstpage
136
Lastpage
140
Abstract
The multifrontal algorithm for sparse LU factorization has been expressed as a data parallel program that is suitable for massively parallel computers. A new way of mapping data and computations to processors is used, and good processor utilization is obtained even for unstructured sparse matrices. The sparse problem is decomposed into many smaller, dense subproblems, with low overhead for communications and memory access. Performance results are provided for factorization of regular and irregular finite-element grid matrices on the MasPar MP-1
Keywords
finite element analysis; mathematics computing; matrix algebra; parallel algorithms; parallel programming; MasPar MP-1; data parallel program; finite-element grid matrices; massively parallel computers; massively parallel sparse LU factorisation; memory access; multifrontal algorithm; processor utilization; Communication networks; Computer architecture; Concurrent computing; Costs; Data structures; Distributed computing; Hardware; Hypercubes; Parallel processing; Sparse matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location
McLean, VA
Print_ISBN
0-8186-2772-7
Type
conf
DOI
10.1109/FMPC.1992.234896
Filename
234896
Link To Document