DATA FLOW REPRESENTATION OF ITERATIVE ALGORITHMS FOR SYSTOLIC ARRAYS

標題:	DATA FLOW REPRESENTATION OF ITERATIVE ALGORITHMS FOR SYSTOLIC ARRAYS
作者:	JEN, CW KWAI, DM 交大名義發表電控工程研究所 National Chiao Tung University Institute of Electrical and Control Engineering
關鍵字:	ALGEBRAIC REPRESENTATION;CHAINING SYSTOLIC ARRAYS;DATA FLOW;DEPENDENCE GRAPH;FLOW VELOCITY;GENERATING FUNCTION;PIPELINING
公開日期:	1-三月-1992
摘要:	An algebraic representation is proposed for regular iterative algorithms that can be described as bundles of data flows with different wavefronts. Modeling data flows with a generating function of power series, this form corresponds to the geometric representation such as a dependence graph. The main attributes of systolic algorithms and arrays are revealed by a unique data flow representation. This provides the ability to pipeline two or more systolic arrays solving different subproblems without intermediate buffering. We use an example to show the case with which our technique can be used.
URI:	http://dx.doi.org/10.1109/12.127448 http://hdl.handle.net/11536/3513
ISSN:	0018-9340
DOI:	10.1109/12.127448
期刊:	IEEE TRANSACTIONS ON COMPUTERS
Volume:	41
Issue:	3
起始頁:	351
結束頁:	355
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。