Optimization of Computation Time for Systolic Arrays

This work deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n/sub sys/*t/sub sys/. The selection of a linear scheduling function, which minimizes n/sub sys/*t/sub sys /is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples. >

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

[2]  Thomas Kailath,et al.  Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms , 1989, J. VLSI Signal Process..

[3]  Ilse C. F. Ipsen,et al.  Parallel Computation of Algorithms with Uniform Dependences , 1989, PPSC.

[4]  H. T. Kung,et al.  Wafer-scale integration and two-level pipelined implementations of systolic arrays , 1984, J. Parallel Distributed Comput..

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

[6]  H. T. Kung.  The Structure of Parallel Algorithms , 1980, Adv. Comput..

[7]  V. van Dongen,et al.  PRESAGE, a tool for the design of low-cost systolic circuits , 1988 .

[8]  Ilse C. F. Ipsen,et al.  Systolic array synthesis: computability and time cones , 1986 .

[9]  Charles E. Leiserson,et al.  Optimizing Synchronous Circuitry by Retiming (Preliminary Version) , 1983 .

[10]  Jose Antonio Baptista Fortes.  Algorithm transformations for parallel processing and vlsi architecture design , 1984 .

[11]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[12]  Dan I. Moldovan,et al.  ADVIS: A Software Package for the Design of Systolic Arrays , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[13]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[14]  Sun-Yuan Kung,et al.  On supercomputing with systolic/wavefront array processors , 1984 .

[15]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[16]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[18]  Alfred Fettweis,et al.  Digital circuits and systems , 1984 .

[19]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[20]  Saburo Muroga,et al.  Input assignment algorithm for decoded-PLAs with multi-input decoders , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

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

[22]  Yiwan Wong.  Algorithms for systolic array synthesis , 1989 .

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

[24]  H. T. Kung.  Systolic algorithms for the CMU warp processor , 1984 .

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