An orthogonal systolic array for the algebraic path problem (Q1822502)
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 4003536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An orthogonal systolic array for the algebraic path problem |
scientific article; zbMATH DE number 4003536 |
Statements
An orthogonal systolic array for the algebraic path problem (English)
0 references
1987
0 references
This paper is devoted to the design of an orthogonal systolic array of \(n(n+1)\) elementary processors which can solve any instance of the Algebraic Path Problem within only 5n-2 time steps, and is compared with the 7n-2 time steps of the hexagonal systolic array of \textit{G. Rote} [Computing 34, 191-219 (1985; Zbl 0546.68047)].
0 references
hardware algorithms
0 references
orthogonal systolic array
0 references
algebraic path problem
0 references
parallel algorithms
0 references
0 references
0.8667973279953003
0 references
