English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93974/124423 (76%)
Visitors : 29052607      Online Users : 310
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69675

    Title: 數值流程圖之最佳處理器分配理論及電腦輔助軟體發展
    Other Titles: A CAD Tool for Data Flow Graph Design and Scheduling
    Authors: 趙玉
    Contributors: 資訊管理學系
    Keywords: 電腦輔助設計;最佳處理器分配;平行處理;資料流程圖
    Computer aided design (CAD);Optimum processor assignment;Parallel processing;Data flow graph
    Date: 1996
    Issue Date: 2014-09-09 17:44:35 (UTC+8)
    Abstract: The scheduling theory of Heemstra de Groot et al. [1] is supplemented by extending the Final Matrix's 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 its 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 the abnormal cases of iteration bounds being 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 integrated graphical CAD tool to view critical and subcritical loops, iteration bounds, scheduling ranges, level and processor assignment diagrams based on a single tool "final matrix" rather than different tools as in [1-3]; (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 folds faster (linear time complexity) than [3] and uses less number of processors in the case of large DFGs.
    Relation: 行政院國家科學委員會
    Data Type: report
    Appears in Collections:[資訊管理學系] 國科會研究計畫

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback