English  |  正體中文  |  简体中文  |  Items with full text/Total items : 88295/117812 (75%)
Visitors : 23399053      Online Users : 97
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/27031
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/27031


    Title: Performance of Multi-Rate Data Flow Graphs for Concurrent Processing
    Authors: 趙玉
    Chao,Daniel Yuh
    Keywords: Concurrent Processing Data Flow Graph (DFG);iteration bound;critical loop;performance;multiple rate;scheduling;Petri nets
    Date: 1997-03
    Issue Date: 2009-01-17 16:03:58 (UTC+8)
    Abstract: Data Flow Graphs (DFGs) [1, 2] are often used to model iterative concurrent activities. The acyclic precedence graph (APG) constructed from a single-rate Data-Flow Graph (SRDFG) can be used to construct an admissible schedule. The iteration period (IP) from this schedule is, in general, not the shortest. Therefore, it is necessary to find the minimum IP of a schedule [2, 20, 35, 40]. Transformation techniques such as retiming [24, 28, 42] and program unfolding [23, 26-27, 35, 41] can uncover hidden concurrency by altering the structure of the SRDFG, resulting in a new APG and, thus, more efficient scheduling due to the shortening of the IP. These techniques cannot, however, shorten the IP indefinitely. The shortest IP (hence, the maximum throughput), called the iteration bound (IB), is a function of the parameters (the number of delay elements and node computation times) of the original SRDFG. The IB for a SRDFG equals the maximum loop bound (LB) of all the loops as shown in [35, 38]. This approach, however, cannot be extended to the multi-rate DFG (MRDFG). Parhi [35] suggested converting the MRDFG into an equivalent SRDFG to find the IB. No explicit formula for IB was presented. How to perform such conversion is not obvious in [35]. Further, the IB of an MRDFG may be a linear additive combination of the loop bounds (LB's) of more than one loop (called loop - combination [12]). It is unclear what the equivalent SRDFG and be since the corresponding IB depends solely on the critical loop (CL). The contributions of this work include (1) developing a procedure to derive Petri Net (PN) models from the MRDFG, (2) finding a procedure with polynomial time complexity to obtain the components of the reproduction vector for an MRDFG, (3) giving a sufficient condition for an MRDFG to be loop-combination free, (4) showing that retiming in an MRDFG is equivalent to getting another reachable marking of its equivalent PN from its initial marking, (5) extending the technique to determine the IB and GL for SRDFG to that for an MRDFG meeting the sufficient condition, and (6) achieving rate-optimal scheduling, i.e., where the IP is identical to the IB, for MRDFG.
    Relation: Journal of Information Science and Engineering, 13(1), 85-123
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML1025View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback