This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Flow Representation of Iterative Algorithms for Systolic Arrays
March 1992 (vol. 41 no. 3)
pp. 351-355

An algebraic representation is proposed for regular iterative algorithms that can be described as bundles of data flows with different wavefronts. A form corresponding to a geometric representation such as a dependence graph is obtained by modeling data flows with a generating function of a power series. The main attributes of systolic algorithms and arrays are revealed by a unique dataflow representation. This provides the ability to pipeline two or more systolic arrays solving different subproblems without intermediate buffering. An example is given to show a case in which the technique can be used.

[1] S. Horiike, S. Nishida, and T. Sakaguchi, "Systematic design of systolic arrays using mapping algorithm," inProc. IEEE Int. Symp. Circuit Syst., 1988, pp. 2505-2508.
[2] H. V. Jagadish and T. Kailath, "A family of new efficient arrays for matrix multiplication,"IEEE Trans. Comput., vol. 38, pp. 149-155, Jan. 1989.
[3] H. V. Jagadish, S. K. Rao, and T. Kailath, "Array architectures for iterative algorithms,"Proc. IEEE, vol. 75, pp. 1304-1321, Sept. 1987.
[4] 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.
[5] H. T. Kung and C. E. Leiserson, "Algorithms for VLSI processor arrays," inIntroduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980.
[6] C. L. Liu,Introduction to Combinatorial Mathematics, New York: McGraw-Hill, 1968.
[7] C. M. Liu and C. W. Jen, "Design of the algorithm-based fault-tolerant VLSI array processor,"IEE Proc., vol. 136, pt. E, pp. 539-547, Nov. 1989.
[8] D. I. Moldovan, "On the analysis and synthesis for VLSI algorithms,"IEEE Trans. Comput., vol. C-31, pp. 1121-1126, Nov. 1982.
[9] D. I. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. 71, pp. 113-120, Jan. 1983.
[10] P. Quinton, "Synthesizing systolic arrays using DIASTOL," inProc. Int. Workshop Systolic Arrays, Univ. Oxford, July 1986, pp. 4.1-4.12.
[11] S.K. Rao and T. Kailath, "Regular Iterative Algorithms and Their Implementation on Processor Arrays,"IEEE Proc., Vol. 76, No. 3, Mar. 1988, pp. 259-269.
[12] J. C. Tsay and Y. C. Hou, "On equivalent systolic designs of matrix multiplication and its algebraic representation," inProc. Int. Comput. Symp., Taiwan, Dec. 1988, pp. 247-252.
[13] J. C. Tsay and Y. C. Hou, "Generating function and equivalent transformation for systolic arrays,"Parallel Comput., vol. 10, pp. 347-356, May 1989.
[14] Y. Yaacoby and P. R. Cappello, "Scheduling a system of affine recurrence equations onto a systolic array," inProc. Int. Conf. Systolic Arrays, 1988, pp. 373-382.

Index Terms:
data flow representation; iterative algorithms; systolic arrays; algebraic representation; geometric representation; dependence graph; modeling; generating function; power series; digital arithmetic; parallel architectures; systolic arrays.
Citation:
Chein-Wei Jen, Ding-Ming Kwai, "Data Flow Representation of Iterative Algorithms for Systolic Arrays," IEEE Transactions on Computers, vol. 41, no. 3, pp. 351-355, March 1992, doi:10.1109/12.127448
Usage of this product signifies your acceptance of the Terms of Use.