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

DOI10.1080/10637199708915616zbMATH Open0873.68088OpenAlexW1966555690MaRDI QIDQ3130158FDOQ3130158

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

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

Recommendations

• Distribution of operations and data arrays over processors
• Scheduling Sequential Loops on Parallel Processors
• scientific article; zbMATH DE number 1535432
• scientific article; zbMATH DE number 4064454
• scientific article; zbMATH DE number 1156669

zbMATH Keywords

systolic arrayautomatic parallelizationloop partitioning

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Time and Parallel Processor Bounds for Fortran-Like Loops
• The parallel execution of DO loops
• The Organization of Computations for Uniform Recurrence Equations
• Synthesizing linear array algorithms from nested FOR loop algorithms

Cited In (2)

• On time optimal implementation of uniform recurrences onto array processors via quadratic programming
• An approach to checking link conflicts in the mapping of uniform dependence algorithms into lower dimensional processor arrays

This page was built for publication: LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS

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