Parallel Cholesky factorization on orthogonal multiprocessors (Q1186181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel Cholesky factorization on orthogonal multiprocessors |
scientific article; zbMATH DE number 36307
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel Cholesky factorization on orthogonal multiprocessors |
scientific article; zbMATH DE number 36307 |
Statements
Parallel Cholesky factorization on orthogonal multiprocessors (English)
0 references
28 June 1992
0 references
The author presents the parallel Cholesky factorization algorithm on orthogonal multiprocessors. Two data allocation strategies --- simple and uniform --- are considered. Three theorems are proved in this context. Studying the asymptotic efficiency, the author shows when each of the strategies should be used.
0 references
time complexity
0 references
parallel Cholesky factorization algorithm
0 references
orthogonal multiprocessors
0 references
data allocation strategies
0 references
asymptotic efficiency
0 references
