A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors

This paper presents a parallel sparse Cholesky factorization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm is a straightforward parallelization of the left-looki...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on scientific computing Ročník 14; číslo 4; s. 761 - 769
Hlavní autoři: Ng, Esmond, Peyton, Barry W.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.07.1993
Témata:
Algorithms
Exact sciences and technology
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Sciences and techniques of general use
Sparsity
Supercomputers
Supercomputer
Parallel algorithm
Linear system
Cholesky method
Sparse matrix
MIMD computer
Factorization
Shared memory
ISSN:1064-8275, 1095-7197
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents a parallel sparse Cholesky factorization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm is a straightforward parallelization of the left-looking supernodal sparse Cholesky factorization algorithm. Like its sequential predecessor, it improves performance by reducing indirect addressing and memory traffic. Experimental results on a Cray Y-MP demonstrate the effectiveness of the new algorithm. On eight processors of a Cray Y-MP, the new routine performs the factorization at rates exceeding one Gflop for several test problems from the Harwell-Boeing sparse matrix collection.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1064-8275
1095-7197
DOI:10.1137/0914048