政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/27037

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 114992/146038 (79%)
造訪人次 : 54202083 線上人數 : 160

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 > Item 140.119/27037

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/27037

題名:	A Fast Implementation for Recurrent DSP Scheduling Using Final Matrix
作者:	趙玉 Chao,Daniel Yuh
關鍵詞:	scheduling;concurrent processing;data flow graph (DFG);final matrix;iteration bound;loop bound;critical loop;CAD
日期:	2000-05
上傳時間:	2009-01-17 16:04:32 (UTC+8)
摘要:	The scheduling theory of Heemstra de Groot et al. is supplemented by extending the Final Matrixs usefulness beyond finding iteration bounds, critical loops and subcritical loops of recursive data flow graphs (RDFGs) to scheduling. DFG is a special case of Petri nets (PN). Hence we apply the cycle time theory of PN to the scheduling of DFG. Contributions include: (1) development of explicit formulas for slack time, scheduling ranges and update, and static rate-optimal time scheduling based on entries of the final matrix; (2) development of a fastest processor assignment algorithm based on the rate-optimal static scheduling without unfolding while considering abnormal cases in which iteration bounds are fractional or smaller than some node execution times; (3) discovery of a new anomaly in addition to the above two cases; (4) development of a user-friendly Final-matrix based Integration Tool (FIT) to view critical and subcritical loops, iteration bounds, scheduling ranges, and level and processor assignment diagrams based on a single tool final matrix rather than other tools; (5) elimination of redundant steps such as the construction of inequality graphs; (6) development of a proof showing that the ALAP and ASAP fixed-time schedulings satisfy the firing rule; and (7) thousand-fold faster (linear time complexity) processing compared to others and use of fewer processors in the case of large DFGs.
關聯:	Journal of Information Science and Engineering, 16(3), 391-422
資料類型:	article
顯示於類別:	[資訊管理學系] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
391-421.pdf	216Kb	Adobe PDF2	474	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

資料載入中.....