Design of space-optimal regular arrays for algorithms with linear schedules

DOI10.1109/12.381953zbMATH Open1041.68515OpenAlexW2102753694MaRDI QIDQ4419699FDOQ4419699

Authors: Jong-Chuang Tsay, Pen-Yuang Chang 

Publication date: 1995

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0cf64259a3b76d2f1bbf880af8d94f483037ad1c

Recommendations

• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
• Partitioning processor arrays under resource constraints
• Partitioning of processor arrays: a piecewise regular approach
• Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming
• On the optimality of linear schedules

zbMATH Keywords

matrix multiplicationdata dependencyalgorithm mapping

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20)

Cited In (5)

• Optimal Interleaving Schemes for Two-Dimensional Arrays
• Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
• Design of processor arrays for reconfigurable architectures
• Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
• Mapping matrix multiplication algorithm onto fault-tolerant systolic array

This page was built for publication: Design of space-optimal regular arrays for algorithms with linear schedules

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