Parallel Cholesky factorization on a shared-memory multiprocessor (Q1072332): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel Cholesky factorization on a shared-memory multiprocessor |
scientific article |
Statements
Parallel Cholesky factorization on a shared-memory multiprocessor (English)
0 references
1986
0 references
A parallel algorithm is developed for Cholesky factorization on a shared- memory multiprocessor. The algorithm is based on self-scheduling of a pool of tasks. The subtasks in several variants of the basic elimination algorithm are analyzed for potential concurrency in terms of precedence relations, work profiles, and processor utilization. This analysis is supported by simulation results. The most promising variant, which we call column-Cholesky, is identified and implemented for the Denelcor HEP multiprocessor. Experimental results are given for this machine.
0 references
numerical examples
0 references
parallel algorithm
0 references
Cholesky factorization
0 references
shared- memory multiprocessor
0 references
elimination algorithm
0 references
