Torus data flow for parallel computation of missized matrix problems (Q1072339)
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: Torus data flow for parallel computation of missized matrix problems |
scientific article; zbMATH DE number 3942906
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Torus data flow for parallel computation of missized matrix problems |
scientific article; zbMATH DE number 3942906 |
Statements
Torus data flow for parallel computation of missized matrix problems (English)
0 references
1986
0 references
A data-flow approach is used to solve dense symmetric systems of equations on a torus-connected 2-D mesh of processors. A torus mapping of the matrix onto this processor array allows the Cholesky decomposition to be completed in 3n-2 time steps using only \(n^ 2/4\) processors (less than half the number needed in previously reported results). New definitions for missized problems and parallel algorithm performance are given along with various time-step, efficiency, and processor utilization plots.
0 references
torus data flow
0 references
parallel computation
0 references
dense symmetric systems
0 references
Cholesky decomposition
0 references
missized problems
0 references
