Synthesis of a new systolic architecture for the algebraic path problem

DOI10.1016/0167-6423(90)90082-OzbMath0723.68076MaRDI QIDQ757083

Yves Robert, Abdelhamid Benaini, Yannick Saouter, Patrice Quinton, Bernard Tourancheau

Publication date: 1990

Published in: Science of Computer Programming (Search for Journal in Brave)

zbMATH Keywords

algebraic path problemrecurrent uniform equationssynthesis of systolic arrays

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Distributed algorithms (68W15) General theory of computer systems (68M01)

Related Items (4)

Algorithm transformations for computational and data broadcast ⋮ Optimal systolic array algorithms for tensor product ⋮ Computing transitive closure on systolic arrays of fixed size ⋮ Synthesis aspects in the design of efficient processor arrays from affine recurrence equations

This page was built for publication: Synthesis of a new systolic architecture for the algebraic path problem