Time Optimal Linear Schedules for Algorithms with Uniform Dependencies

The authors address the problem of identifying optimal linear schedules for uniform dependence algorithms so that their execution time is minimized. Procedures are proposed to solve this problem based on the mathematical solution of a nonlinear optimization problem. The complexity of these procedures is independent of the size of the algorithm. Actually, the complexity is exponential in the dimension of the index set of the algorithm, and for all practical purposes, very small due to the limited dimension of the index set of algorithms of practical interest. A particular class of algorithms for which the proposed solution is greatly simplified is considered, and the corresponding simpler organization procedure is provided. >

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

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

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

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

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

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

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

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

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

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

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

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

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

[14]  Sailesh K. Rao,et al.  Regular interactive algorithms and their implementations on processor arrays , 1986 .

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

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

[17]  Ron Cytron,et al.  Doacross: Beyond Vectorization for Multiprocessors , 1986, ICPP.

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

[19]  José A. B. Fortes,et al.  Time optimal linear schedules for algorithms with uniform dependencies , 1988, [1988] Proceedings. International Conference on Systolic Arrays.

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

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

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

[23]  Weijia Shang.  Scheduling, partitioning and mapping of uniform dependence algorithms on processor arrays , 1990 .

[24]  Weijia Shang,et al.  Independent Partitioning of Algorithms with Uniform Dependencies , 1992, IEEE Trans. Computers.

[25]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .