Near optimal Cholesky factorization on orthogonal multiprocessors. (Q1853099)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1856436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near optimal Cholesky factorization on orthogonal multiprocessors. |
scientific article; zbMATH DE number 1856436 |
Statements
Near optimal Cholesky factorization on orthogonal multiprocessors. (English)
0 references
21 January 2003
0 references
The effect of data allocation strategies on the running time of parallel Cholesky factorization algorithms on orthogonal multiprocessors has been studied. Four new strategies which give better running time are proposed and their time complexities are analyzed. Finally it is shown that near optimal performance can be obtained using two of our strategies.
0 references
Parallel algorithms
0 references
Cholesky factorization
0 references
Orthogonal multiprocessors
0 references
0.9295167922973632
0 references
0.8353334069252014
0 references
0.8272730708122253
0 references
0.8233156204223633
0 references
0.8122643232345581
0 references
