Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem (Q751176)
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: Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem |
scientific article; zbMATH DE number 4176335
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem |
scientific article; zbMATH DE number 4176335 |
Statements
Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem (English)
0 references
1990
0 references
This paper describes systolic arrays for Gaussian elimination and the algebraic path problem, in which the theoretical minimum number of computing steps is achieved, and the number of processors required is minimized among these time-minimal solutions.
0 references
systolic arrays
0 references
Gaussian elimination
0 references
algebraic path problem
0 references
minimum number of computing steps
0 references
number of processors
0 references
time-minimal solutions
0 references
0.8188029527664185
0 references
0.8179183006286621
0 references
