LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS

DOI10.1080/10637199708915616zbMath0873.68088OpenAlexW1966555690MaRDI QIDQ3130158

Panayiotis Tsanakas, Zacharias Tsiatsoulis, George Papakonstantinou, Nectarios Koziris, Theodore Andronikos

Publication date: 22 April 1997

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199708915616

zbMATH Keywords

systolic arrayautomatic parallelizationloop partitioning

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Synthesizing linear array algorithms from nested FOR loop algorithms
• Time and Parallel Processor Bounds for Fortran-Like Loops
• The parallel execution of DO loops
• The Organization of Computations for Uniform Recurrence Equations