Space-Time Representation of Iterative Algorithms and the Design of Regular Processor Arrays

A novel space-time representation of iterative algorithms, which can be expressed in nested loop form and may include non-constant dependencies is proposed and a systematic methodology for their mapping onto regular processor arrays is presented. In contrast to previous design methodologies, the execution time of any variable instance is explicitly expressed in the Dependence Graph, by the construction of the Space-Time Dependence Graph (STDG). This approach avoids the uniformization step of the algorithm and the requirement for fully indexing the variables.

[1]  Monica S. Lam,et al.  A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..

[2]  Jih-Kwon Peir,et al.  Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors , 1989, IEEE Trans. Computers.

[3]  Y. Wong,et al.  Broadcast removal in systolic algorithms , 1988, [1988] Proceedings. International Conference on Systolic Arrays.

[4]  PEIZONG LEE,et al.  Synthesizing Linear Array Algorithms from Nested For Loop Algorithms , 2015, IEEE Trans. Computers.

[5]  Ed F. Deprettere,et al.  Analysis and modeling of sequential iterative algorithms for parallel and pipeline implementations , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[6]  Peter R. Cappello,et al.  Scheduling a system of affine recurrence equations onto a systolic array , 1988, [1988] Proceedings. International Conference on Systolic Arrays.

[7]  Dan I. Moldovan,et al.  Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[8]  Constantinos E. Goutis,et al.  An Efficient Decompostion Technique for Mapping Nested Loops with Constant Dependencies into Regular Processor Arrays , 1992, J. Parallel Distributed Comput..

[9]  Dimitrios Soudris,et al.  Design methodology for direct mapping of iterative algorithms on array architectures , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[10]  Leslie Lamport,et al.  The parallel execution of DO loops , 1974, CACM.

[11]  Ron Cytron,et al.  What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation , 1987, ICPP.

[12]  Richard M. Karp,et al.  The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.

[13]  Thomas Kailath,et al.  Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.

[14]  Tomás Lang,et al.  Matrix Computations on Systolic-Type Meshes , 1990, Computer.

[15]  Patrice Quinton,et al.  The systematic design of systolic arrays , 1987 .

[16]  Patrice Quinton,et al.  The mapping of linear recurrence equations on regular arrays , 1989, J. VLSI Signal Process..