Issue No.03 - March (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127448
<p>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.</p>
data flow representation; iterative algorithms; systolic arrays; algebraic representation; geometric representation; dependence graph; modeling; generating function; power series; digital arithmetic; parallel architectures; systolic arrays.
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