Time optimal linear schedules for algorithms with uniform dependencies

The problem of identifying the time-optimal linear schedules for uniform dependence algorithms with any convex-polyhedron index set is addressed. Optimization procedures are proposed, and the class of algorithms is identified for which the total execution times by the optimal linear schedule and the free schedule that schedules the computation to execute as soon as its operands are available are equal. This method is useful in mapping algorithms onto systolic/MIMD (multiple-instruction, multiple-instruction stream) systems.<<ETX>>

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

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

[3]  Rami G. Melhem,et al.  Synthesizing Non-Uniform Systolic Designs , 1986, ICPP.

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

[5]  Peter R. Cappello,et al.  Unifying VLSI Array Designs with Geometric Transformations , 1983, International Conference on Parallel Processing.

[6]  Robert Henry Kuhn,et al.  Optimization and interconnection complexity for: parallel processors, single-stage networks, and decision trees , 1980 .

[7]  W. Miranker,et al.  Parallel methods for the numerical integration of ordinary differential equations , 1967 .

[8]  P. Quinton.  Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

[9]  Weijia Shang,et al.  Independent Partitioning of Algorithms With Uniform Data Dependencies , 1988, International Conference on Parallel Processing.

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

[11]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[12]  Matthew T. O'Keefe,et al.  A Comparative Study of Two Systematic Design Methodologies for Systolic Arrays , 1986, ICPP.

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

[14]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[15]  Bryan D. Ackland,et al.  Dynamic Time Warp Pattern Matching Using an Integrated Multiprocessing Array , 1983, IEEE Transactions on Computers.

[16]  Marina C. Chen,et al.  A Design Methodology for Synthesizing Parallel Algorithms and Architectures , 1986, J. Parallel Distributed Comput..

[17]  David Alejandro Padua Haiek.  Multiprocessors: discussion of some theoretical and practical problems , 1980 .

[18]  François Irigoin,et al.  Supernode partitioning , 1988, POPL '88.

[19]  Benjamin W. Wah,et al.  The Design of Optimal Systolic Arrays , 1985, IEEE Transactions on Computers.