Modeling optimal granularity when adapting systolic algorithms to transputer based supercomputers

DOI10.1016/0167-8191(94)90008-6MaRDI QIDQ1323649zbMATH OpenOpenAlexFDO

Authors E. Montagne, F. Breant, Marta Rukoz, Rina Suros

Publication date 26 January 1995

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90008-6

zbMATH Keywords

performance evaluationparallel algorithmsparallel linear algebrasystolic algorithmtransputersmatrix product algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Recommendations

• scientific article; zbMATH DE number 278840
• scientific article; zbMATH DE number 3896291
• scientific article; zbMATH DE number 3921974
• The Design of Optimal Systolic Arrays
• On the design of some systolic algorithms

This page was built for publication: Modeling optimal granularity when adapting systolic algorithms to transputer based supercomputers

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