English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93219/123591 (75%)
Visitors : 27758392      Online Users : 389
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
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/27037
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/27037

    Title: A Fast Implementation for Recurrent DSP Scheduling Using Final Matrix
    Authors: 趙玉
    Chao,Daniel Yuh
    Keywords: scheduling;concurrent processing;data flow graph (DFG);final matrix;iteration bound;loop bound;critical loop;CAD
    Date: 2000-05
    Issue Date: 2009-01-17 16:04:32 (UTC+8)
    Abstract: The scheduling theory of Heemstra de Groot et al. 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 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.
    Relation: Journal of Information Science and Engineering, 16(3), 391-422
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    391-421.pdf216KbAdobe PDF402View/Open

    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