Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution

DOI10.1016/0167-8191(92)90077-KzbMath0741.68017OpenAlexW1988109205MaRDI QIDQ1186178

Philippe Clauss, Guy-René Perrin, Catherine Mongenet

Publication date: 28 June 1992

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90077-k

zbMATH Keywords

algebraic path problemmapping method for systolic algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (2)

Synthesis aspects in the design of efficient processor arrays from affine recurrence equations ⋮ Geometrical tools to map systems of affine recurrence equations on regular arrays

This page was built for publication: Synthesis of size-optimal toroïdal arrays for the algebraic path problem: A new contribution