Explicit parallel block Cholesky algorithms on the CRAY APP (Q1917406)
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: Explicit parallel block Cholesky algorithms on the CRAY APP |
scientific article; zbMATH DE number 897502
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit parallel block Cholesky algorithms on the CRAY APP |
scientific article; zbMATH DE number 897502 |
Statements
Explicit parallel block Cholesky algorithms on the CRAY APP (English)
0 references
13 July 1997
0 references
Some basic linear algorithms are considered for the specialized parallel system CRAY APP (Attached Parallel Processor) with the multibus interconnection topology. As a first problem, the matrix multiplication is analyzed carefully for this system. A parallelization of two versions of the Cholesky decomposition algorithm (called left- and right-looking algorithms) represent a kernel theme of the paper. Both versions are compared and it is shown how the data-distribution strategies influence the performance. A performance model for this architecture is also developed. The paper concludes with computer experiments for both algorithms performed on the APP system with 28 processors.
0 references
parallel computation
0 references
CRAY APP
0 references
matrix multiplication
0 references
Cholesky decomposition algorithm
0 references
left- and right-looking algorithms
0 references
performance
0 references
