An orthogonal systolic array for the algebraic path problem
type: Item
instance of: scholarly article
title: An orthogonal systolic array for the algebraic path problem
zbMATH Open document ID: 0618.68051
DOI: 10.1007/BF02309554
published in: Computing
publication date: 1987-01-01T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4003536
zbMATH Keywords: hardware algorithms
zbMATH Keywords: orthogonal systolic array
zbMATH Keywords: algebraic path problem
zbMATH Keywords: parallel algorithms
author: Yves Robert
author: Denis Trystram
MaRDI profile type: Publication
cites work: Q3324922
cites work: Q4190126
cites work: A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
cites work: Linear and combinatorial optimization in ordered algebraic structures
full work available at URL: https://doi.org/10.1007/bf02309554
OpenAlex ID: W4308562043
description: scientific article; zbMATH DE number 4003536