This Article 
 Bibliographic References 
 Add to: 
Optimization of Computation Time for Systolic Arrays
February 1992 (vol. 41 no. 2)
pp. 159-177

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] H. M. Ahmed, J.-M. Delosme, and M. Morf, "Highly concurrent computing structures for matrix arithmetic and signal processing,"IEEE Comput. Mag., vol. 15, pp. 65-81, Jan. 1982.
[2] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[3] P. R. Cappello and K. Steiglitz, "Unifying VLSI array designs with geometric transformations," inProc. Int. Conf. Parallel Processing, 1983, pp. 448-457.
[4] K.-C. Chen and S. Muroga, "Input assignment algorithm for decoded-PLA's with multi-input decoders," inProc. Int. Conf. Comput.-Aided Design, Nov. 1988, pp. 474-477.
[5] J.-M. Delosme and I. C. F. Ipsen, "An illustration of a methodology for the construction of efficient systolic architectures in VLSI," inProc. 2nd Int. Symp VLSI Technology, Syst., and Appl., May 1985, pp. 268-273.
[6] J.-M. Delosme and I. C. F. Ipsen, "Systolic array synthesis: Computability and time cones," inParallel Algorithms&Architectures, M. Cosnardet al., Eds. New York: Elsevier Science, 1986, pp. 295-312.
[7] J.-M. Delosme and I. C. F. Ipsen, "Parallel computation of algorithms with uniform dependences," inProc. 4th SIAM Conf. Parallel Processing for Scientif. Comput., Dec. 1989, pp. 319-325.
[8] A. Fettweis, "Digital circuits and systems,"IEEE Trans. Circuits Syst., vol. CAS-31, no. 1, pp. 31-48, 1984.
[9] J. A. B. Fortes, "Algorithm transformations for parallel processing and VLSI architecture design," Ph.D. dissertation, Univ. of Southern California, Los Angeles, Dec. 1983.
[10] R. Karp, R. Miller, and S. Winograd, "The Organization of Computations for Uniform Recurrence Equations,"J. ACM, Vol. 14, No. 3, 1967, pp. 563-590.
[11] H. Kasahara and S. Narita, "Practical multiprocessor scheduling algorithms for efficient parallel processing,"IEEE Trans. Comput., vol. C-33, no. 11, pp. 1023-1029, 1984.
[12] H. T. Kung and C. E. Leiserson, "Systolic arrays for VLSI,"Sparse Matrix Proceedings, SIAM, pp. 245-282, 1978.
[13] H. T. Kung, "The structure of parallel algorithms," inAdvances in Computers, Vol. 19. New York: Academic, 1980.
[14] H. T. Kung and M. S. Lam, "Wafer-scale integration and two-level pipelined implementations of systolic arrays,"J. Parallel Distributed Comput., vol. 1, pp. 32-63, 1984.
[15] H. T. Kung, "Systolic algorithms for the CMU warp processor," inSystolic Signal Processing, E. Swartzlander, Ed. New York: Marcel Dekker, 1987, pp. 73-96.
[16] S. Y. Kung, "On supercomputing with systolic/wavefront array processors,"Proc. IEEE, vol. 72, pp. 867-884, July 1984.
[17] E. L. Lawler,Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
[18] C. E. Leiserson, F. M. Rose, and J. B. Saxe, "Optimizing synchronous circuitry by retiming," inThird Caltech Conference on VLSI, R. Bryant, Ed. Rockville, MD: Computer Science Press, 1983, pp. 87-116.
[19] G.-J. Li and B. W. Wah, "The design of optimal systolic arrays,"IEEE Trans. Comput., vol. C-34, pp. 66-77, 1985.
[20] J. Li, M. Chen, and M. Young, "Design of systolic algorithms for large scale multiprocessors," Res. Rep. YALEU/DCS/RR-513, Dep. Comput. Sci., Yale Univ., Oct. 1988.
[21] B. Lisper, "Time-optimal synthesis of systolic arrays with pipelined cells," Res. Rep. YALEU/DCS/RR-560, Dep. Comput. Sci., Yale Univ., Sept. 1987.
[22] D. I. Moldovan, "ADVIS: A software package for the design of systolic arrays," inProc. Int. Conf. Comput. Design, 1984, pp. 158-164.
[23] G. L. Nemhouser and L. A. Wolsey,Integer and Combinatorial Optimization. New York: Wiley, 1988.
[24] C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[25] P. Quinton, "Automatic synthesis of systolic arrays from uniform recurrent equations," inProc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208-214.
[26] S. K. Rao, "Regular iterative algorithms and their implementations on processor arrays," Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
[27] S. K. Rao and T. Kailath, "Architecture design for regular iterative algorithms," inSystolic Signal Processing Systems. E. E. Swartzlander, Ed. New York: Marcel Dekker, 1987, pp. 209-298.
[28] V. van Dongen, "PRESAGE, A tool for the design of low-cost systolic circuits," inProc. Int. Symp. Circuits and Syst., June 1988, pp. 2765-2768.
[29] Y. Wang, "Algorithms for systolic array synthesis," Ph.D. dissertation,Dep. Comput. Sci., Yale Univ., Dec. 1989.

Index Terms:
multiple functional units; pipelined functional units; concurrency; computation time minimization; systolic arrays; linear scheduling function; combinatorial optimization problem; bounded search space; branch-and-bound method; minimisation; multiprocessor interconnection networks; parallel algorithms; systolic arrays.
Yiwan Wong, J.-M. Delosme, "Optimization of Computation Time for Systolic Arrays," IEEE Transactions on Computers, vol. 41, no. 2, pp. 159-177, Feb. 1992, doi:10.1109/12.123393
Usage of this product signifies your acceptance of the Terms of Use.