
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
CheinWei Jen, DingMing Kwai, "Data Flow Representation of Iterative Algorithms for Systolic Arrays," IEEE Transactions on Computers, vol. 41, no. 3, pp. 351355, March, 1992.  
BibTex  x  
@article{ 10.1109/12.127448, author = {CheinWei Jen and DingMing Kwai}, title = {Data Flow Representation of Iterative Algorithms for Systolic Arrays}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {3}, issn = {00189340}, year = {1992}, pages = {351355}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.127448}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Data Flow Representation of Iterative Algorithms for Systolic Arrays IS  3 SN  00189340 SP351 EP355 EPD  351355 A1  CheinWei Jen, A1  DingMing Kwai, PY  1992 KW  data flow representation; iterative algorithms; systolic arrays; algebraic representation; geometric representation; dependence graph; modeling; generating function; power series; digital arithmetic; parallel architectures; systolic arrays. VL  41 JA  IEEE Transactions on Computers ER   
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. 25052508.
[2] H. V. Jagadish and T. Kailath, "A family of new efficient arrays for matrix multiplication,"IEEE Trans. Comput., vol. 38, pp. 149155, Jan. 1989.
[3] H. V. Jagadish, S. K. Rao, and T. Kailath, "Array architectures for iterative algorithms,"Proc. IEEE, vol. 75, pp. 13041321, 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. 563590.
[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: AddisonWesley, 1980.
[6] C. L. Liu,Introduction to Combinatorial Mathematics, New York: McGrawHill, 1968.
[7] C. M. Liu and C. W. Jen, "Design of the algorithmbased faulttolerant VLSI array processor,"IEE Proc., vol. 136, pt. E, pp. 539547, Nov. 1989.
[8] D. I. Moldovan, "On the analysis and synthesis for VLSI algorithms,"IEEE Trans. Comput., vol. C31, pp. 11211126, Nov. 1982.
[9] D. I. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. 71, pp. 113120, Jan. 1983.
[10] P. Quinton, "Synthesizing systolic arrays using DIASTOL," inProc. Int. Workshop Systolic Arrays, Univ. Oxford, July 1986, pp. 4.14.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. 259269.
[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. 247252.
[13] J. C. Tsay and Y. C. Hou, "Generating function and equivalent transformation for systolic arrays,"Parallel Comput., vol. 10, pp. 347356, 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. 373382.