完整後設資料紀錄
DC 欄位語言
dc.contributor.authorJEN, CWen_US
dc.contributor.authorKWAI, DMen_US
dc.date.accessioned2014-12-08T15:05:00Z-
dc.date.available2014-12-08T15:05:00Z-
dc.date.issued1992-03-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://dx.doi.org/10.1109/12.127448en_US
dc.identifier.urihttp://hdl.handle.net/11536/3513-
dc.description.abstractAn 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.en_US
dc.language.isoen_USen_US
dc.subjectALGEBRAIC REPRESENTATIONen_US
dc.subjectCHAINING SYSTOLIC ARRAYSen_US
dc.subjectDATA FLOWen_US
dc.subjectDEPENDENCE GRAPHen_US
dc.subjectFLOW VELOCITYen_US
dc.subjectGENERATING FUNCTIONen_US
dc.subjectPIPELININGen_US
dc.titleDATA FLOW REPRESENTATION OF ITERATIVE ALGORITHMS FOR SYSTOLIC ARRAYSen_US
dc.typeNoteen_US
dc.identifier.doi10.1109/12.127448en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume41en_US
dc.citation.issue3en_US
dc.citation.spage351en_US
dc.citation.epage355en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department電控工程研究所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentInstitute of Electrical and Control Engineeringen_US
dc.identifier.wosnumberWOS:A1992HL50700010-
dc.citation.woscount1-
顯示於類別:期刊論文


文件中的檔案:

  1. A1992HL50700010.pdf

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