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

DOI10.1016/0167-8191(92)90077-KMaRDI QIDQ1186178zbMATH OpenOpenAlexFDO

Authors Philippe Clauss, Catherine Mongenet, Guy-René Perrin

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

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

Recommendations

• An orthogonal systolic array for the algebraic path problem
• A family of efficient regular arrays for algebraic path problem
• Optimal array pattern synthesis using semidefinite programming
• A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem
• Optimal routing in toroidal networks
• scientific article; zbMATH DE number 64177
• scientific article; zbMATH DE number 3870611
• A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
• Synthesis of a new systolic architecture for the algebraic path problem

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186178)